Sciweavers

7129 search results - page 1105 / 1426
» Approximation Algorithms for Treewidth
Sort
View
134
Voted
IROS
2009
IEEE
195views Robotics» more  IROS 2009»
15 years 10 months ago
Appearance contrast for fast, robust trail-following
— We describe a framework for finding and tracking “trails” for autonomous outdoor robot navigation. Through a combination of visual cues and ladar-derived structural inform...
Christopher Rasmussen, Yan Lu, Mehmet Kocamaz
IROS
2009
IEEE
129views Robotics» more  IROS 2009»
15 years 10 months ago
Lane boundary and curb estimation with lateral uncertainties
— This paper describes an algorithm for estimating lane boundaries and curbs from a moving vehicle using noisy observations and a probabilistic model of curvature. The primary co...
Albert S. Huang, Seth J. Teller
129
Voted
AAIM
2009
Springer
98views Algorithms» more  AAIM 2009»
15 years 10 months ago
Latency Constrained Aggregation in Chain Networks Admits a PTAS
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
Tim Nonner, Alexander Souza
146
Voted
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
15 years 10 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
111
Voted
WG
2009
Springer
15 years 10 months ago
Sub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
Rajiv Gandhi, Bradford Greening, Sriram V. Pemmara...
« Prev « First page 1105 / 1426 Last » Next »