Sciweavers

3341 search results - page 545 / 669
» On Bounded Queries and Approximation
Sort
View
COMPGEOM
2007
ACM
15 years 1 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
TPDS
2008
91views more  TPDS 2008»
14 years 9 months ago
SSW: A Small-World-Based Overlay for Peer-to-Peer Search
Peer-to-peer (P2P) systems have become a popular platform for sharing and exchanging voluminous information among thousands or even millions of users. The massive amount of inform...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam, Jin...
GIS
2002
ACM
14 years 9 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
ICCV
2009
IEEE
16 years 2 months ago
Curvature Regularity for Region-based Image Segmentation and Inpainting: A Linear Programming Relaxation
We consider a class of region-based energies for image segmentation and inpainting which combine region integrals with curvature regularity of the region boundary. To minimize s...
Thomas Schoenemann, Fredrik Kahl, Daniel Cremers
ICCV
2009
IEEE
16 years 2 months ago
Extending Continuous Cuts: Anisotropic Metrics and Expansion Moves
The concept of graph cuts is by now a standard method for all sorts of low level vision problems. Its popularity is largely due to the fact that globally or near globally optimal...
Carl Olsson, Martin Byr¨od, Niels Chr. Overgaard,...