4155 search results - page 115 / 831 » Topic-Specific Optimization and Structuring |
151
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
240
click to vote
GLOBECOM
2008
IEEE
16 years 26 days ago
2008
IEEE
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
182
click to vote
PPOPP
2005
ACM
15 years 12 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
149
click to vote
IPCO
1996
15 years 7 months ago
1996
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
180
click to vote
WADS
1997
Springer
15 years 10 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...