338 search results - page 60 / 68 » Fast distributed random walks |
140
click to vote
PODC
2011
ACM
14 years 13 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
CIVR
2007
Springer
15 years 3 months ago
2007
Springer
Though both quantity and quality of semantic concept detection in video are continuously improving, it still remains unclear how to exploit these detected concepts as semantic ind...
IDEAS
2003
IEEE
15 years 2 months ago
2003
IEEE
Overlay networks have received a lot of attention due to the recent wide-spread use of peer-to-peer (P2P) applications such as SETI, Napster, Gnutella, and Morpheus. Through repli...
ACL
1994
14 years 11 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...