Sciweavers

1040 search results - page 193 / 208
» Rounding algorithms for covering problems
Sort
View
JAIR
2007
120views more  JAIR 2007»
14 years 9 months ago
An Algebraic Graphical Model for Decision with Uncertainties, Feasibilities, and Utilities
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can ...
Cédric Pralet, Gérard Verfaillie, Th...
ECCV
1998
Springer
15 years 11 months ago
Motion Recovery from Image Sequences: Discrete Viewpoint vs. Differential Viewpoint
Abstract. The aim of this paper is to explore intrinsic geometric methods of recovering the three dimensional motion of a moving camera from a sequence of images. Generic similarit...
Yi Ma, Jana Kosecka, Shankar Sastry
ECCV
2006
Springer
15 years 11 months ago
The Alignment Between 3-D Data and Articulated Shapes with Bending Surfaces
In this paper we address the problem of aligning 3-D data with articulated shapes. This problem resides at the core of many motion tracking methods with applications in human motio...
Guillaume Dewaele, Frederic Devernay, Radu Horaud,...
INFOCOM
2006
IEEE
15 years 3 months ago
Minimum-Energy Broadcast Using Practical Directional Antennas in All-Wireless Networks
— Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio ...
Sabyasachi Roy, Y. Charlie Hu, Dimitrios Peroulis,...
SIGCOMM
2005
ACM
15 years 3 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...