Sciweavers

6274 search results - page 571 / 1255
» From query complexity to computational complexity
Sort
View
COMPGEOM
2011
ACM
14 years 10 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
ICDE
2002
IEEE
126views Database» more  ICDE 2002»
16 years 8 months ago
Sequenced Subset Operators: Definition and Implementation
Difference, intersection, semi-join and anti-semi-join may be considered binary subset operators, in that they all return a subset of their left-hand argument. These operators are...
Joseph Dunn, Sean Davey, Anne Descour, Richard T. ...
VLDB
2007
ACM
130views Database» more  VLDB 2007»
16 years 7 months ago
A Simple and Efficient Estimation Method for Stream Expression Cardinalities
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
Aiyou Chen, Jin Cao, Tian Bu
CIVR
2009
Springer
174views Image Analysis» more  CIVR 2009»
16 years 1 months ago
Evaluation of GIST descriptors for web-scale image search
The GIST descriptor has recently received increasing attention in the context of scene recognition. In this paper we evaluate the search accuracy and complexity of the global GIST...
Matthijs Douze, Herve Jegou, Harsimrat Sandhawalia...
DAWAK
2007
Springer
16 years 1 months ago
Automating the Schema Matching Process for Heterogeneous Data Warehouses
Abstract. A federated data warehouse is a logical integration of data warehouses applicable when physical integration is impossible due to privacy policy or legal restrictions. In ...
Marko Banek, Boris Vrdoljak, A. Min Tjoa, Zoran Sk...