Sciweavers

676 search results - page 30 / 136
» On Approximation Lower Bounds for TSP with Bounded Metrics
Sort
View
TSP
2010
14 years 6 months ago
Noisy data and impulse response estimation
Abstract--This paper investigates the impulse response estimation of linear time-invariant (LTI) systems when only noisy finitelength input-output data of the system is available. ...
Soosan Beheshti, Munther A. Dahleh
SPAA
2009
ACM
16 years 9 days ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...
SODA
2003
ACM
157views Algorithms» more  SODA 2003»
15 years 1 months ago
Competitive queueing policies for QoS switches
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
Nir Andelman, Yishay Mansour, An Zhu
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 11 days ago
Numerical linear algebra in the streaming model
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...
Kenneth L. Clarkson, David P. Woodruff
ICALP
2004
Springer
15 years 5 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee