628 search results - page 111 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
163
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
157
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
167
click to vote
ECCV
2002
Springer
16 years 7 months ago
2002
Springer
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
164
Voted
ICRA
1999
IEEE
15 years 10 months ago
1999
IEEE
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilisticlocalization algorithms known as Monte...
152
click to vote
INFOCOM
2007
IEEE
16 years 4 days ago
2007
IEEE
Abstract—In this paper, we develop passive network tomography techniques for inferring link-level anomalies like excessive loss rates and delay from path-level measurements. Our ...