Results 11 to 20 of about 9,334,973 (302)
Proceedings of the International Conference on Automated Planning and Scheduling, 2022 In top-k planning, the objective is to determine a set of k cheapest plans that provide several good alternatives to choose from. Such a solution set often contains plans that visit at least one state more than once. Depending on the application, plans with such loops are of little importance because they are dominated by a loopless representative and ...
Tschammer, Julian von +2 more
openaire +4 more sources
Top-$k$ Preferences in High Dimensions [PDF]
IEEE Transactions on Knowledge and Data Engineering, 2014 Given a set of objects O, each with d numeric attributes, a top-k preference scores these objects using a linear combination of their attribute values, where the weight on each attribute reflects the interest in this attribute. Given a query preference q, a top-k query finds the k objects in O with highest scores with respect to q. Given a query object
Albert Yu 0001 +2 more
openaire +2 more sources
, 2015 The subject of this thesis is the intelligent caching of top-k queries in an environment with high latency and low throughput. In such an environment, caching can be used to reduce network traffic and improve response time. Slow database connections of mobile devices and to databases, which have been offshored, are practical use cases. A semantic cache
Ehlers, Christoph (Dipl.-Inf.)
openaire +2 more sources
Temporally relevant parallel top-k spatial keyword search
Journal of Spatial Information Science, 2022 New spatio-textual indexing methods are needed to support efficient search and update of the massive amounts of spatially referenced text being generated.
Suprio Ray, Bradford Nickerson
doaj +1 more source
Adversarial Top- $K$ Ranking [PDF]
IEEE Transactions on Information Theory, 2017 We study the top-$K$ ranking problem where the goal is to recover the set of top-$K$ ranked items out of a large collection of items based on partially revealed preferences. We consider an adversarial crowdsourced setting where there are two population sets, and pairwise comparison samples drawn from one of the populations follow the standard Bradley ...
Changho Suh +2 more
openaire +2 more sources
Diversifying top-k results [PDF]
Proceedings of the VLDB Endowment, 2012 Top- k query processing finds a list of k results that have largest scores w.r.t the user given query, with the assumption that all the k results are independent to each other. In practice, some of the top- k results returned can be very similar
Lu Qin 0001, Jeffrey Xu Yu, Lijun Chang
openaire +2 more sources
QDetect: Time Series Querying Based Road Anomaly Detection
IEEE Access, 2020 Road anomaly detection has attracting increasing attention in recent years due to its significant role in the public transportation of modern cities. A few methods has been proposed to detect road anomaly with inertial sensors (e.g., accelerometer and ...
Zengwei Zheng +4 more
doaj +1 more source
Towards efficient top-k fuzzy auto-completion queries
Alexandria Engineering Journal, 2022 Finding relevant objects in a large repository is a fundamental research problem occurring in many applications, such as: data cleaning, data integration, web search, and information retrieval.
Magdy AbdelNaby +3 more
doaj +1 more source
Improved Top-k Query Algorithm in Distributed Networks [PDF]
Jisuanji gongcheng, 2017 Existing Top-k query algorithms are mainly applied in the centralized relational database.However,the algorithms will cause huge communication costs and low efficiency in the distributed networks.In order to solve these problems,an improved Top-k Query ...
YANG Hao,LIN Xijun,QU Haipeng
doaj +1 more source