Sciweavers

334 search results - page 48 / 67
» Efficient Algorithms for the Tree Homeomorphism Problem
Sort
View
SOFSEM
2000
Springer
15 years 1 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
177
Voted
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
15 years 11 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe
69
Voted
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
14 years 11 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
CVPR
2010
IEEE
15 years 4 months ago
Variational Segmentation of Volumetric Elongated Objects
We present an interactive approach for segmenting thin volumetric structures. The proposed segmentation model is based on an anisotropic weighted Total Variation energy with a glob...
Christian Reinbacher, Thomas Pock, Christian Bauer...
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
14 years 9 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid