4137 search results - page 255 / 828 » On the number of matchings of a tree |
308
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
141
Voted
DAC
2002
ACM
16 years 7 months ago
2002
ACM
In this paper, we present a flexible accelerator designed for networking applications. The accelerator can be utilized efficiently by a variety of Network Processor designs. Most ...
206
click to vote
WEBDB
2009
Springer
16 years 1 months ago
2009
Springer
The ubiquitous adoption of XML as the standard of data exchange over the web has led to increased interest in building efficient and scalable XML publish-subscribe (pub-sub) syste...
190
click to vote
NETWORKING
2010
15 years 8 months ago
2010
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
179
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up t...