Sciweavers

214 search results - page 21 / 43
» Perfect and Almost Perfect Sequences
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
ICASSP
2008
IEEE
14 years 2 months ago
Compressed sensing with sequential observations
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of measurements. The results in the literature have focuse...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
PLDI
2006
ACM
14 years 1 months ago
Automatic instruction scheduler retargeting by reverse-engineering
In order to generate high-quality code for modern processors, a compiler must aggressively schedule instructions, maximizing resource utilization for execution efficiency. For a ...
Matthew J. Bridges, Neil Vachharajani, Guilherme O...
ECCV
2006
Springer
14 years 9 months ago
Face Recognition from Video Using the Generic Shape-Illumination Manifold
Abstract. In spite of over two decades of intense research, illumination and pose invariance remain prohibitively challenging aspects of face recognition for most practical applica...
Ognjen Arandjelovic, Roberto Cipolla
BMCBI
2007
97views more  BMCBI 2007»
13 years 7 months ago
A verification protocol for the probe sequences of Affymetrix genome arrays reveals high probe accuracy for studies in mouse, hu
Background: The Affymetrix GeneChip technology uses multiple probes per gene to measure its expression level. Individual probe signals can vary widely, which hampers proper interp...
Rudi Alberts, Peter Terpstra, Menno Hardonk, Leoni...