Sciweavers

1689 search results - page 52 / 338
» Proximate point searching
Sort
View
115
Voted
VLDB
2002
ACM
188views Database» more  VLDB 2002»
15 years 9 days ago
Continuous Nearest Neighbor Search
A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., "find all my nearest gas stations during my route from point s...
Yufei Tao, Dimitris Papadias, Qiongmao Shen
97
Voted
COMPGEOM
1995
ACM
15 years 4 months ago
Searching for the Kernel of a Polygon - A Competitive Strategy
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
Christian Icking, Rolf Klein
112
Voted
ICCV
2007
IEEE
16 years 2 months ago
Localizing Unordered Panoramic Images Using the Levenshtein Distance
This paper proposes a feature-based method for recovering the relative positions of the viewpoints of a set of panoramic images for which no a priori order information is availabl...
Damien Michel, Antonis A. Argyros, Manolis I. A. L...
EOR
2008
103views more  EOR 2008»
15 years 22 days ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...
COMGEO
1999
ACM
15 years 10 days ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid