Sciweavers

6274 search results - page 40 / 1255
» From query complexity to computational complexity
Sort
View
SIGMOD
2003
ACM
147views Database» more  SIGMOD 2003»
14 years 10 months ago
Formal semantics and analysis of object queries
Modern database systems provide not only powerful data models but also complex query languages supporting powerful features such as the ability to create new database objects and ...
Gavin M. Bierman
CSB
2005
IEEE
136views Bioinformatics» more  CSB 2005»
14 years 3 months ago
Computational Method for Temporal Pattern Discovery in Biomedical Genomic Databases
With the rapid growth of biomedical research databases, opportunities for scientific inquiry have expanded quickly and led to a demand for computational methods that can extract b...
Mohammed I. Rafiq, Martin J. O'Connor, Amar K. Das
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 2 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
DIS
2006
Springer
14 years 1 months ago
Itemset Support Queries Using Frequent Itemsets and Their Condensed Representations
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...
Taneli Mielikäinen, Pance Panov, Saso Dzerosk...
ICALP
2004
Springer
14 years 3 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee