5022 search results - page 653 / 1005 » Data structures and problem solving using Java |
180
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
191
click to vote
TODS
2002
15 years 6 months ago
2002
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
165
click to vote
ECCV
1994
Springer
16 years 8 months ago
1994
Springer
Abstract. We propose a new approach to the correspondence problem that makes use of non-parametric local transforms as the basis for correlation. Non-parametric local transforms re...
151
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
We consider the sensor broadcast problem: in our setup, sensors measure each one pixel of an image that unfolds over a field, and broadcast a rate constrained encoding of their me...
190
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We address the problem of feature selection in a kernel space to select the most discriminative and informative features for classification and data analysis. This is a difficult ...