2168 search results - page 140 / 434 » Randomized Algorithms and Complexity Theory |
150
Voted
SDM
2008
SIAM
15 years 4 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
107
click to vote
CRYPTO
2003
Springer
15 years 8 months ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
131
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This study examines the utility of meta-grammar constant generation on a series of benchmark problems. The performance of the meta-grammar approach is compared to a grammar which ...
180
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
155
Voted
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...