2434 search results - page 112 / 487 » Algorithmic Randomness of Closed Sets |
138
Voted
JCDL
2009
ACM
15 years 10 months ago
2009
ACM
Users of digital libraries usually want to know the exact author or authors of an article. But different authors may share the same names, either as full names or as initials and...
143
Voted
AAAI
2008
15 years 5 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
137
Voted
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
131
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
126
click to vote
ECCC
2000
15 years 3 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...