Sciweavers

467 search results - page 85 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
PAMI
2006
229views more  PAMI 2006»
13 years 8 months ago
A Coherent Computational Approach to Model Bottom-Up Visual Attention
Visual attention is a mechanism which filters out redundant visual information and detects the most relevant parts of our visual field. Automatic determination of the most visually...
Olivier Le Meur, Patrick Le Callet, Dominique Barb...
TCOM
2010
106views more  TCOM 2010»
13 years 6 months ago
On the system level prediction of joint time frequency spreading systems with carrier phase noise
- Phase noise is a topic of theoretical and practical interest in electronic circuits. Although progress has been made in the characterization of its description, there are still c...
Youssef Nasser, Mathieu Des Noes, Laurent Ros, Gen...
TIT
2010
128views Education» more  TIT 2010»
13 years 3 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh
GCB
2009
Springer
154views Biometrics» more  GCB 2009»
14 years 12 days ago
Comparative Identification of Differential Interactions from Trajectories of Dynamic Biological Networks
Abstract: It is often challenging to reconstruct accurately a complete dynamic biological network due to the scarcity of data collected in cost-effective experiments. This paper ad...
Zhengyu Ouyang, Mingzhou Song
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
14 years 2 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma