Sciweavers

447 search results - page 46 / 90
» Approximation Algorithms for the Discrete Time-Cost Tradeoff...
Sort
View
123
Voted
SIAMSC
2008
139views more  SIAMSC 2008»
15 years 3 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
COMPGEOM
2011
ACM
14 years 7 months ago
Compressive sensing with local geometric features
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachli...
135
Voted
FOCS
2007
IEEE
15 years 10 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 5 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
142
Voted
AAAI
2006
15 years 5 months ago
Comparative Experiments on Sentiment Classification for Online Product Reviews
Evaluating text fragments for positive and negative subjective expressions and their strength can be important in applications such as single- or multi- document summarization, do...
Hang Cui, Vibhu O. Mittal, Mayur Datar