3341 search results - page 358 / 669 » On Bounded Queries and Approximation |
181
click to vote
SWAT
2000
Springer
15 years 10 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
191
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
267
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
289
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
326
click to vote
ICDE
1996
IEEE
16 years 8 months ago
1996
IEEE
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...