Sciweavers

780 search results - page 20 / 156
» Robustness and Randomness
Sort
View
FSTTCS
1991
Springer
14 years 10 days ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich
NIPS
2001
13 years 10 months ago
Partially labeled classification with Markov random walks
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
Martin Szummer, Tommi Jaakkola
GLOBECOM
2009
IEEE
14 years 3 months ago
Channel Aware Distributed Random Access
—We investigate distributed channel-aware random access for networks with arbitrary topologies and traffic distributions, where users can receive traffic from or send traffic ...
Guowang Miao, Ye (Geoffrey) Li, Ananthram Swami
ICIP
2005
IEEE
14 years 2 months ago
Medical image registration based on random line sampling
One of the key aspects in 3D-image registration is the computation of the joint intensity histogram. We propose a new approach to compute this histogram using uniformly distribute...
Anton Bardera, Miquel Feixas, Imma Boada, Mateu Sb...
BMCBI
2008
95views more  BMCBI 2008»
13 years 9 months ago
Unsupervised reduction of random noise in complex data by a row-specific, sorted principal component-guided method
Background: Large biological data sets, such as expression profiles, benefit from reduction of random noise. Principal component (PC) analysis has been used for this purpose, but ...
Joseph W. Foley, Fumiaki Katagiri