31 search results - page 6 / 7 » Efficient Algorithms for Computing the Nearest Polynomial wi... |
PVLDB
2008
13 years 4 months ago
2008
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
TIT
2008
13 years 4 months ago
2008
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
ALGORITHMICA
1998
13 years 4 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
ICPR
2004
IEEE
14 years 6 months ago
2004
IEEE
Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision...
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
It is a well known classical result that given the image projections of three known world points it is possible to solve for the pose of a calibrated perspective camera to up to f...