1578 search results - page 119 / 316 » Direct Routing: Algorithms and Complexity |
VLDB
2005
ACM
14 years 2 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
PODS
2010
ACM
14 years 1 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
CONPAR
1992
14 years 29 days ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
DSD
2010
IEEE
13 years 9 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
VTC
2008
IEEE
14 years 3 months ago
2008
IEEE
— The second-order statistics of a time-domain signal are very often used in blind and semi-blind channel estimation. Considering that the received signal in MIMO-OFDM systems mi...