5752 search results - page 425 / 1151 » Informative Labeling Schemes |
165
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
148
click to vote
JCP
2006
15 years 6 months ago
2006
The generalized multiprotocol label switching (GMPLS) networks attain a hierarchical structure, and each layer maintains an independent protection mechanism, resulting in redundant...
158
click to vote
IS
2007
15 years 6 months ago
2007
In this paper, we study the use of XML tagged keywords (or simply key-tags) to search an XML fragment in a collection of XML documents. We present techniques that are able to empl...
151
click to vote
CN
2002
15 years 5 months ago
2002
Destination-based forwarding in traditional IP routers has not been able to take full advantage of multiple paths that frequently exist in Internet Service Provider Networks. As a...
156
click to vote
JCO
2010
15 years 4 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...