Sciweavers

5153 search results - page 174 / 1031
» Introduction to Randomized Algorithms
Sort
View
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
15 years 6 months ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel
PAMI
2008
270views more  PAMI 2008»
15 years 3 months ago
Randomized Clustering Forests for Image Classification
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
Frank Moosmann, Eric Nowak, Frédéric...
TOCS
2008
107views more  TOCS 2008»
15 years 2 months ago
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership...
Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot
INFOCOM
2010
IEEE
15 years 1 months ago
Reliability in Layered Networks with Random Link Failures
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...
Kayi Lee, Hyang-Won Lee, Eytan Modiano
CVPR
2011
IEEE
14 years 11 months ago
Inference for Order Reduction in Markov Random Fields
This paper presents an algorithm for order reduction of factors in High-Order Markov Random Fields (HOMRFs). Standard techniques for transforming arbitrary high-order factors in...
Andrew C. Gallagher, Dhruv Batra, Devi Parikh