8431 search results - page 416 / 1687 » Algorithmically Independent Sequences |
153
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
155
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We show that it is possible to use data compression on independently obtained hypotheses from various tasks to algorithmically provide guarantees that the tasks are sufficiently r...
160
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
162
click to vote
ANTSW
2004
Springer
16 years 9 days ago
2004
Springer
Various clustering methods based on the behaviour of real ants have been proposed. In this paper, we develop a new algorithm in which the behaviour of the artificial ants is gover...
207
click to vote
WDAG
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. With the emergence of the internet, independent applications are starting to be integrated with each other. This creates a need for technology for glueing together applic...