Sciweavers

3875 search results - page 540 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
CVPR
2006
IEEE
16 years 8 months ago
Improving Border Localization of Multi-Baseline Stereo Using Border-Cut
This paper presents a novel algorithm that improves the localization of disparity discontinuities of disparity maps obtained by multi-baseline stereo. Rather than associating a di...
Marc-Antoine Drouin, Martin Trudeau, Sébast...
RECOMB
2006
Springer
16 years 7 months ago
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
Martin Bader, Enno Ohlebusch
QEST
2008
IEEE
16 years 29 days ago
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye...
ICRA
2006
IEEE
120views Robotics» more  ICRA 2006»
16 years 19 days ago
Autonomous Enhancement of Disruption Tolerant Networks
— Mobile robots have successfully solved many real world problems. In the following we present the use of mobile robots to address the novel and challenging problem of providing ...
Brendan Burns, Oliver Brock, Brian Neil Levine
VTC
2006
IEEE
118views Communications» more  VTC 2006»
16 years 18 days ago
Minimum Energy Cooperative Path Routing in Wireless Networks: An Integer Programming Formulation
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...
Fulu Li, Andrew Lippman, Kui Wu