Sciweavers

5153 search results - page 435 / 1031
» Introduction to Randomized Algorithms
Sort
View
COMPGEOM
2009
ACM
15 years 11 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
INFOCOM
2005
IEEE
15 years 10 months ago
On neighbor discovery in wireless networks with directional antennas
We consider the problem of neighbor discovery in static wireless ad hoc networks with directional antennas. We propose several probabilistic algorithms in which nodes perform rand...
Sudarshan Vasudevan, James F. Kurose, Donald F. To...
SAGA
2007
Springer
15 years 11 months ago
Probabilistic Techniques in Algorithmic Game Theory
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Spyros C. Kontogiannis, Paul G. Spirakis
BVAI
2005
Springer
15 years 10 months ago
Incomplete Contour Representations and Shape Descriptors: ICR Test Studies
Inspired by psychophysical studies of the human cognitive abilities we propose a novel aspect and a method for performance evaluation of contour based shape recognition algorithms ...
Anarta Ghosh, Nicolai Petkov
KI
1999
Springer
15 years 9 months ago
Systematic vs. Local Search for SAT
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
Holger H. Hoos, Thomas Stützle