Sciweavers

200 search results - page 36 / 40
» Linear analysis and optimization of stream programs
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
14 years 7 months ago
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
Emmanuel J. Candès, Yaniv Plan
COMSUR
2011
198views Hardware» more  COMSUR 2011»
13 years 9 months ago
Optical Layer Monitoring Schemes for Fast Link Failure Localization in All-Optical Networks
—Optical layer monitoring and fault localization serves as a critical functional module in the control and management of optical networks. An efficient monitoring scheme aims at ...
Bin Wu, Pin-Han Ho, Kwan Lawrence Yeung, Já...
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 years 6 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
STACS
2005
Springer
15 years 2 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
PODS
2006
ACM
138views Database» more  PODS 2006»
15 years 9 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri