Sciweavers

1404 search results - page 260 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 4 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
BROADNETS
2007
IEEE
14 years 4 months ago
Strategic deployment of network monitors for attack attribution
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
Young June Pyun, Douglas S. Reeves
IROS
2007
IEEE
156views Robotics» more  IROS 2007»
14 years 4 months ago
Learning maps in 3D using attitude and noisy vision sensors
— In this paper, we address the problem of learning 3D maps of the environment using a cheap sensor setup which consists of two standard web cams and a low cost inertial measurem...
Bastian Steder, Giorgio Grisetti, Slawomir Grzonka...
SMI
2007
IEEE
208views Image Analysis» more  SMI 2007»
14 years 4 months ago
A Partition-of-Unity Based Algorithm for Implicit Surface Reconstruction Using Belief Propagation
In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface ar...
Yi-Ling Chen, Shang-Hong Lai
CPAIOR
2007
Springer
14 years 3 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter