135 search results - page 9 / 27 » Approximability Distance in the Space of H-Colourability Pro... |
JMLR
2010
13 years 2 months ago
2010
We address instance-based learning from a perceptual organization standpoint and present methods for dimensionality estimation, manifold learning and function approximation. Under...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Given an integer k, a representative skyline contains the k skyline points that best describe the tradeoffs among different dimensions offered by the full skyline. Although this to...