1813 search results - page 130 / 363 » Calculi of Approximation Spaces |
171
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
169
click to vote
DASFAA
2005
IEEE
16 years 11 hour ago
2005
IEEE
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an efficient distributed intersect...
147
click to vote
SSD
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Many new applications involving moving objects require the collection and querying of trajectory data, so efficient indexing methods are needed to support complex spatio...
197
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
156
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...