2262 search results - page 43 / 453 » Points with large quadrant-depth |
198
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
LCN
2006
IEEE
15 years 5 months ago
2006
IEEE
In wireless local area networks often a station can potentially associate with more than one access point. Therefore, a relevant question is which access point to select “bestâ€...
105
click to vote
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
101
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
115
click to vote
EUROPAR
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive proc...