Sciweavers

5153 search results - page 378 / 1031
» Introduction to Randomized Algorithms
Sort
View
JSAC
2008
139views more  JSAC 2008»
15 years 4 months ago
A Game-Theoretic Framework for Medium Access Control
In this paper, we generalize the random access game model, and show that it provides a general game-theoretic framework for designing contention based medium access control. We ext...
Tao Cui, Lijun Chen, Steven H. Low
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
15 years 4 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
BIOADIT
2004
Springer
15 years 10 months ago
Searching for a Practical Evidence of the No Free Lunch Theorems
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
Mihai Oltean
COMGEO
2010
ACM
15 years 4 months ago
Approximate centerpoints with proofs
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...
Gary L. Miller, Donald Sheehy

Source Code
846views
15 years 11 months ago
Supervised Color Image Segmentation in a Markovian Framework
This is the sample implementation of a Markov random field based color image segmentation algorithm described in the following paper: Zoltan Kato, Ting Chuen Pong, and John Chu...
Mihaly Gara, Zoltan Kato