Sciweavers

7930 search results - page 1272 / 1586
» Greedy in Approximation Algorithms
Sort
View
180
Voted
INFOCOM
2009
IEEE
16 years 23 days ago
Link Scheduling with QoS Guarantee for Wireless Relay Networks
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...
Chi-Yao Hong, Ai-Chun Pang
IROS
2009
IEEE
195views Robotics» more  IROS 2009»
16 years 22 days 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»
16 years 22 days 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
159
Voted
AAIM
2009
Springer
98views Algorithms» more  AAIM 2009»
16 years 22 days 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
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
16 years 21 days 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
« Prev « First page 1272 / 1586 Last » Next »