179 search results - page 20 / 36 » Distributed Algorithms for Constructing a Depth-First-Search... |
SOFSEM
1997
Springer
13 years 11 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
SIGIR
2011
ACM
12 years 10 months ago
2011
ACM
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
AINA
2006
IEEE
14 years 1 months ago
2006
IEEE
Efficient service discovery in dynamic, crossorganizational VO is one of the challenge aspects in ChinaGrid. Network overlay and search algorithms are two important considerations...
BROADNETS
2006
IEEE
13 years 9 months ago
2006
IEEE
Multicast protocols for MANET typically construct a tree or mesh structure for multicast message distribution. Typical implementations impose scalability and efficiency limitation...