117 search results - page 17 / 24 » Routing on Trees via Matchings |
159
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting rowid li...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
In ongoing research, a collaborative peer network application is being proposed to address the scalability limitations of centralized search engines. Here we introduce a local ada...
ICON
2007
IEEE
15 years 4 months ago
2007
IEEE
—Inter-domain routing is suffering from the lack of identifiers for the rapidly growing number of Autonomous Systems (AS), and therefore the 4-byte AS number has been proposed a...
84
Voted
DAM
2007
14 years 9 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...