Sciweavers

274 search results - page 4 / 55
» Computational complexity of queries based on itemsets
Sort
View
100
Voted
PPDP
2010
Springer
14 years 8 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
86
Voted
FOCS
2006
IEEE
15 years 4 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
109
Voted
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 21 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
101
Voted
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
15 years 10 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
75
Voted
CVPR
2007
IEEE
16 years 8 days ago
Searching Video for Complex Activities with Finite State Models
We describe a method of representing human activities that allows a collection of motions to be queried without examples, using a simple and effective query language. Our approach...
Nazli Ikizler, David A. Forsyth