1091 search results - page 88 / 219 » Approximation in Databases |
103
Voted
ICPR
2000
IEEE
16 years 3 months ago
2000
IEEE
Content-based image retrievalsystems use low-levelfeatures like color and texturefor image representation. Given these representationsasfeature vectors, similarity between images ...
118
click to vote
SODA
2000
ACM
15 years 3 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
115
click to vote
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
150
Voted
TCC
2012
Springer
13 years 10 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
109
Voted
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...