11345 search results - page 1839 / 2269 » Foundations of Computer Science |
145
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
148
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
118
click to vote
CSR
2006
Springer
15 years 8 months ago
2006
Springer
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....
152
click to vote
DIS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We propose an approach to subgroup discovery using distribution rules (a kind of association rules with a probability distribution on the consequent) for numerical proper...
153
click to vote
ERSHOV
2006
Springer
15 years 8 months ago
2006
Springer
A new coordination language for distributed data-parallel programs is presented, call SNet. The intention of SNet is to introduce advanced structuring techniques into a coordinatio...