Sciweavers

1233 search results - page 45 / 247
» Extensible Point Location Algorithm
Sort
View
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 1 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
IPTPS
2004
Springer
15 years 3 months ago
The Case for a Hybrid P2P Search Infrastructure
Popular P2P file-sharing systems like Gnutella and Kazaa use unstructured network designs. These networks typically adopt flooding-based search techniques to locate files. Whil...
Boon Thau Loo, Ryan Huebsch, Ion Stoica, Joseph M....
ESA
2001
Springer
104views Algorithms» more  ESA 2001»
15 years 2 months ago
Smallest Color-Spanning Objects
Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest— by perimeter or area—axis-parallel rectangle and...
Manuel Abellanas, Ferran Hurtado, Christian Icking...
MM
2006
ACM
152views Multimedia» more  MM 2006»
15 years 3 months ago
Local image representations using pruned salient points with applications to CBIR
Salient points are locations in an image where there is a significant variation with respect to a chosen image feature. Since the set of salient points in an image capture import...
Hui Zhang, Rouhollah Rahmani, Sharath R. Cholleti,...
FOCS
2006
IEEE
15 years 3 months ago
Points on Computable Curves
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...
Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo