5153 search results - page 596 / 1031 » Introduction to Randomized Algorithms |
185
click to vote
NIPS
2000
15 years 7 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...
200
click to vote
AAAI
1996
15 years 7 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...
140
click to vote
COLING
1996
15 years 7 months ago
1996
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
188
click to vote
DAGSTUHL
1996
15 years 7 months ago
1996
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
175
click to vote
GI
2008
Springer
15 years 7 months ago
2008
Springer
: This paper investigates organization problems of large wireless sensor networks. In spite of their random deployment, nodes have to organize themselves as energy efficient as pos...