1457 search results - page 96 / 292 » On the Uniform Distribution of Strings |
152
Voted
COMBINATORICS
2000
15 years 6 months ago
2000
We study the limiting distribution of the height in a generalized trie in which external nodes are capable to store up to b items (the so called b-tries). We assume that such a tr...
188
Voted
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
We propose an In-Network Data-Centric Storage (INDCS) scheme for answering ad-hoc queries in sensor networks. Previously proposed In-Network Storage (INS) schemes suffered from St...
134
click to vote
BIRTHDAY
2009
Springer
16 years 28 days ago
2009
Springer
Lappin and Francez (1994) present a theory of donkey anaphora which, they claim, captures both their existential and their universal readings, while maintaining a uniform represent...
156
click to vote
COCO
2009
Springer
16 years 21 days ago
2009
Springer
We study the task of randomness extraction from sources which are distributed uniformly on an unknown algebraic variety. In other words, we are interested in constructing a functi...
141
click to vote
ICDM
2007
IEEE
16 years 13 days ago
2007
IEEE
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...