5580 search results - page 680 / 1116 » Randomized priority algorithms |
156
click to vote
NIPS
2004
15 years 5 months ago
2004
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
151
click to vote
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...
138
click to vote
MASCOTS
2003
15 years 5 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
144
click to vote
NIPS
2000
15 years 5 months ago
2000
Bayesian networks are graphical representations of probability distributions. In virtually all of the work on learning these networks, the assumption is that we are presented with...
172
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...