2434 search results - page 116 / 487 » Algorithmic Randomness of Closed Sets |
123
Voted
PAKDD
2007
ACM
15 years 9 months ago
2007
ACM
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
124
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— The present paper investigates practical algorithms to efficiently exploit random network coding for data delivery in multi-hop wireless networks. In the past few years, a gre...
124
Voted
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
119
Voted
SIGIR
2006
ACM
15 years 9 months ago
2006
ACM
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
141
Voted
EUROCRYPT
2010
Springer
15 years 6 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...