Sciweavers

619 search results - page 40 / 124
» Random Bichromatic Matchings
Sort
View
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
13 years 8 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye
ICIP
2007
IEEE
14 years 3 months ago
Multiscale Random Projections for Compressive Classification
We propose a framework for exploiting dimension-reducing random projections in detection and classification problems. Our approach is based on the generalized likelihood ratio te...
Marco F. Duarte, Mark A. Davenport, Michael B. Wak...
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
14 years 28 days ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
IPL
2010
93views more  IPL 2010»
13 years 7 months ago
Randomized algorithms for online bounded bidding
In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...
Leah Epstein, Asaf Levin

Book
5396views
15 years 7 months ago
Markov Random Field Modeling in Computer Vision
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
Stan Z. Li