Sciweavers

562 search results - page 51 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
INFOCOM
2008
IEEE
15 years 4 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
GECCO
2004
Springer
15 years 3 months ago
On the Choice of the Population Size
Abstract. Evolutionary Algorithms (EAs) are population-based randomized optimizers often solving problems quite successfully. Here, the focus is on the possible effects of changin...
Tobias Storch
AC
2003
Springer
15 years 3 months ago
Concentration Inequalities
Concentration inequalities deal with deviations of functions of independent random variables from their expectation. In the last decade new tools have been introduced making it pos...
Stéphane Boucheron, Gábor Lugosi, Ol...
JMLR
2006
113views more  JMLR 2006»
14 years 9 months ago
Generalized Bradley-Terry Models and Multi-Class Probability Estimates
The Bradley-Terry model for obtaining individual skill from paired comparisons has been popular in many areas. In machine learning, this model is related to multi-class probabilit...
Tzu-Kuo Huang, Ruby C. Weng, Chih-Jen Lin
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
15 years 4 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang