2434 search results - page 286 / 487 » Algorithmic Randomness of Closed Sets |
120
Voted
STOC
1998
ACM
15 years 8 months ago
1998
ACM
A commitment protocol is a fundamental cryptographic primitive used as a basic buildingblock throughoutmodern cryptography. In STOC 1991, Dolev Dwork and Naor showed that in many ...
120
click to vote
ALDT
2009
Springer
15 years 8 months ago
2009
Springer
We study the problem of allocating a set of indivisible items to players having additive utility functions over the items. We consider allocations in which no player envies the bun...
146
click to vote
ICANN
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
150
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
170
click to vote
AAAI
1996
15 years 5 months ago
1996
Procedural representations of control policies have two advantages when facing the scale-up problem in learning tasks. First they are implicit, with potential for inductive genera...