Sciweavers

3874 search results - page 206 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
SODA
1997
ACM
119views Algorithms» more  SODA 1997»
15 years 5 months ago
Map Labeling and Its Generalizations
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, ...
130
Voted
COLOGNETWENTE
2008
15 years 5 months ago
A Simple 3-Approximation of Minimum Manhattan Networks
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
Bernhard Fuchs, Anna Schulze
ECCV
2006
Springer
16 years 5 months ago
Discovering Texture Regularity as a Higher-Order Correspondence Problem
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
James Hays, Marius Leordeanu, Alexei A. Efros, Yan...
IPL
2008
111views more  IPL 2008»
15 years 3 months ago
Flying over a polyhedral terrain
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
Hamid Zarrabi-Zadeh
IJAR
2006
98views more  IJAR 2006»
15 years 3 months ago
A forward-backward Monte Carlo method for solving influence diagrams
Although influence diagrams are powerful tools for representing and solving complex decisionmaking problems, their evaluation may require an enormous computational effort and this...
Andrés Cano, Manuel Gómez, Seraf&iac...