6251 search results - page 438 / 1251 » Randomness, Computability, and Density |
157
click to vote
ISAAC
1999
Springer
15 years 11 months ago
1999
Springer
We study the online problem of holding a number of idle threads on an application server, which we have ready for processing new requests. The problem stems from the fact that bot...
138
click to vote
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
175
click to vote
COMPGEOM
1997
ACM
15 years 11 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
183
click to vote
CAAP
1992
15 years 11 months ago
1992
We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of node...
161
click to vote
AAAI
2010
15 years 8 months ago
2010
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...