Sciweavers

4894 search results - page 897 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Sparse decomposition of transformation-invariant signals with continuous basis pursuit
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
Chaitanya Ekanadham, Daniel Tranchina, Eero P. Sim...
ICASSP
2011
IEEE
12 years 11 months ago
Robust nonparametric regression by controlling sparsity
Nonparametric methods are widely applicable to statistical learning problems, since they rely on a few modeling assumptions. In this context, the fresh look advocated here permeat...
Gonzalo Mateos, Georgios B. Giannakis
FGR
2011
IEEE
247views Biometrics» more  FGR 2011»
12 years 11 months ago
Segment and recognize expression phase by fusion of motion area and neutral divergence features
—An expression can be approximated by a sequence of temporal segments called neutral, onset, offset and apex. However, it is not easy to accurately detect such temporal segments ...
Shizhi Chen, YingLi Tian, Qingshan Liu, Dimitris N...
IR
2011
12 years 11 months ago
Modeling score distributions in information retrieval
We review the history of modeling score distributions, focusing on the mixture of normal-exponential by investigating the theoretical as well as the empirical evidence supporting i...
Avi Arampatzis, Stephen Robertson
SIGMOD
2011
ACM
150views Database» more  SIGMOD 2011»
12 years 10 months ago
WHAM: a high-throughput sequence alignment method
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
Yinan Li, Allison Terrell, Jignesh M. Patel