1982 search results - page 43 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
134
click to vote
SIGIR
2008
ACM
15 years 6 months ago
2008
ACM
Algorithms in distributed information retrieval often rely on accurate knowledge of the size of a collection. The "multiple capture-recapture" method of Shokouhi et al. ...
197
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
178
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
Scheduling plays a central role in the behavioral synthesis process, which automatically compiles high-level specifications into optimized hardware implementations. However, most ...
170
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...
162
click to vote
SIGKDD
2002
15 years 5 months ago
2002
Research in secure distributed computation, which was done as part of a larger body of research in the theory of cryptography, has achieved remarkable results. It was shown that n...