5153 search results - page 203 / 1031 » Introduction to Randomized Algorithms |
128
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
140
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
116
click to vote
ICASSP
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper addresses the problem of state estimation in the case where the prior distribution of the states is not perfectly known but instead is parameterized by some unknown par...
113
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—We investigate approximating joint distributions of random processes with causal dependence tree distributions. Such distributions are particularly useful in providing parsimoni...
103
click to vote
COLING
2010
14 years 10 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...