Sciweavers

93 search results - page 4 / 19
» Conditional hardness for approximate coloring
Sort
View
PVLDB
2010
134views more  PVLDB 2010»
13 years 5 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
FOCS
2007
IEEE
14 years 1 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
ICASSP
2011
IEEE
12 years 11 months ago
Iterative hard thresholding for compressed sensing with partially known support
Recent works in modified compressed sensing (CS) show that reconstruction of sparse or compressible signals with partially known support yields better results than traditional CS...
Rafael E. Carrillo, Luisa F. Polania, Kenneth E. B...
IMAGING
2000
13 years 8 months ago
Quantifying Mixed Adaptation in Cross-Media Color Reproduction
This paper describes an investigation undertaken to address the goal set by the CIE Technical committee TC804: "To investigate the state of adaptation of the visual system wh...
Sharron A. Henley, Mark D. Fairchild
WG
2007
Springer
14 years 1 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...