2168 search results - page 325 / 434 » Randomized Algorithms and Complexity Theory |
123
click to vote
WSC
2000
15 years 4 months ago
2000
Input modeling that involves fitting standard univariate parametric probability distributions is typically performed using an input modeling package. These packages typically fit ...
134
click to vote
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
126
click to vote
WWW
2007
ACM
16 years 3 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
109
click to vote
SBIA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
143
click to vote
ESA
2004
Springer
15 years 8 months ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...