Pages that link to "Item:Q1401963"

The following pages link to Optimal aggregation algorithms for middleware. (Q1401963):

Displaying 38 items.

• Group skyline computation (Q454943) (← links)
• Top-\(k\) vectorial aggregation queries in a distributed environment (Q635316) (← links)
• \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models (Q660968) (← links)
• On the semantics of top-\(k\) ranking for objects with uncertain data (Q660976) (← links)
• A top-\(k\) query answering procedure for fuzzy logic programming (Q695268) (← links)
• Top-\(k\) retrieval for ontology mediated access to relational databases (Q712661) (← links)
• Skyline ranking for uncertain databases (Q726402) (← links)
• Dominant skyline query processing over multiple time series (Q744313) (← links)
• A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
• Approximately dominating representatives (Q870264) (← links)
• On the memory requirements of XPath evaluation over XML streams (Q878756) (← links)
• Ontological query answering under many-valued group preferences in Datalog\(+/-\) (Q1726403) (← links)
• Exact and efficient top-\(K\) inference for multi-target prediction by querying separable linear relational models (Q1741286) (← links)
• A time optimized scheme for top-\( k\) list maintenance over incomplete data streams (Q1749630) (← links)
• Finding hidden independent sets in interval graphs (Q1884976) (← links)
• Supporting early pruning in top-\(k\) query processing on massive data (Q1944943) (← links)
• Index-based, high-dimensional, cosine threshold querying with optimality guarantees (Q2035468) (← links)
• Effective and efficient top-\(k\) query processing over incomplete data streams (Q2054092) (← links)
• A top-k retrieval algorithm based on a decomposition of ranking functions (Q2200719) (← links)
• Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces (Q2282287) (← links)
• Relational division in rank-aware databases (Q2282883) (← links)
• Monoidal functional dependencies (Q2353408) (← links)
• Approximate distributed top-\(k\) queries (Q2377247) (← links)
• Optimally adaptive integration of univariate Lipschitz functions (Q2480911) (← links)
• Efficient Algorithms and Cost Models for Reverse Spatial-Keyword <i>k</i> -Nearest Neighbor Search (Q2790129) (← links)
• On the Complexity of Query Result Diversification (Q2790132) (← links)
• A filter-based uniform algorithm for optimizing top-k query in distributed networks (Q3446048) (← links)
• Representing and Quantifying Rank - Change for the Web Graph (Q3520042) (← links)
• Simple, Robust and Optimal Ranking from Pairwise Comparisons (Q4558526) (← links)
• (Q5091121) (← links)
• Transducing Markov sequences (Q5501935) (← links)
• OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE (Q5694054) (← links)
• (Q5875525) (← links)
• Efficiently answering top-k frequent term queries in temporal-categorical range (Q6065960) (← links)
• Top-\(k\) team synergy problem: capturing team synergy based on C3 (Q6125438) (← links)
• An approximation algorithm for \(K\)-best enumeration of minimal connected edge dominating sets with cardinality constraints (Q6562874) (← links)
• Analysis of ranking data (Q6600381) (← links)
• Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints (Q6657233) (← links)