Sciweavers

6251 search results - page 10 / 1251
» Randomness, Computability, and Density
Sort
View
ICASSP
2011
IEEE
13 years 10 days ago
Scalable robust hypothesis tests using graphical models
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
Divyanshu Vats, Vishal Monga, Umamahesh Srinivas, ...
ICCS
2004
Springer
14 years 2 months ago
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
Taneli Mielikäinen, Janne Ravantti, Esko Ukko...
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 2 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
PAMI
2010
146views more  PAMI 2010»
13 years 7 months ago
A Generalized Kernel Consensus-Based Robust Estimator
In this paper, we present a new Adaptive Scale Kernel Consensus (ASKC) robust estimator as a generalization of the popular and state-of-the-art robust estimators such as RANSAC (R...
Hanzi Wang, Daniel Mirota, Gregory D. Hager