64 search results - page 12 / 13 » Distributed Spanning Tree Algorithms for Large Scale Travers... |
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
SIGSOFT
2007
ACM
14 years 5 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
ICDE
2005
IEEE
14 years 6 months ago
2005
IEEE
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
BMCBI
2005
13 years 4 months ago
2005
Background: Microarray experiments, as well as other genomic analyses, often result in large gene sets containing up to several hundred genes. The biological significance of such ...