5115 search results - page 195 / 1023 » On Randomized Lanczos Algorithms |
158
click to vote
AAAI
1998
15 years 8 months ago
1998
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
208
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
We present MI-CRF, a conditional random field (CRF) model for multiple instance learning (MIL). MI-CRF models bags as nodes in a CRF with instances as their states. It combines di...
185
click to vote
CORR
2010
Springer
15 years 7 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...
200
click to vote
SIAMCOMP
1998
15 years 6 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 ...
178
click to vote
ICASSP
2010
IEEE
15 years 5 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...