Sciweavers

610 search results - page 77 / 122
» An Efficient Method for Compressed Sensing
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Detection of sparse signals under finite-alphabet constraints
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
Zhi Tian, Geert Leus, Vincenzo Lottici
ICMCS
2006
IEEE
113views Multimedia» more  ICMCS 2006»
14 years 4 months ago
Fast Multi-Reference Frame Motion Estimation via Downhill Simplex Search
Multi-reference frame motion estimation improves the accuracy of motion compensation in video compression, but it also dramatically increases computational complexity. Based on tr...
Chen-Kuo Chiang, Shang-Hong Lai
ALMOB
2008
131views more  ALMOB 2008»
13 years 10 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
BMCBI
2010
136views more  BMCBI 2010»
13 years 10 months ago
SCPS: a fast implementation of a spectral method for detecting protein families on a genome-wide scale
Background: An important problem in genomics is the automatic inference of groups of homologous proteins from pairwise sequence similarities. Several approaches have been proposed...
Tamás Nepusz, Rajkumar Sasidharan, Alberto ...
POPL
1992
ACM
14 years 2 months ago
A Compilation Method for ML-Style Polymorphic Record Calculi
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
Atsushi Ohori