Sciweavers

5580 search results - page 144 / 1116
» Randomized priority algorithms
Sort
View
CORR
2007
Springer
123views Education» more  CORR 2007»
14 years 10 months ago
On Distributed Computation in Noisy Random Planar Networks
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
Yashodhan Kanoria, D. Manjunath
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 9 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
CVPR
2006
IEEE
16 years 2 hour ago
AdaBoost.MRF: Boosted Markov Random Forests and Application to Multilevel Activity Recognition
Activity recognition is an important issue in building intelligent monitoring systems. We address the recognition of multilevel activities in this paper via a conditional Markov r...
Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh, ...
ICALP
2004
Springer
15 years 3 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 2 months 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