1578 search results - page 12 / 316 » Direct Routing: Algorithms and Complexity |
WEA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
DAC
2009
ACM
14 years 9 months ago
2009
ACM
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear comp...
MICAI
2005
Springer
14 years 2 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
MOBIHOC
2008
ACM
14 years 8 months ago
2008
ACM
We present Virtual Cord Protocol (VCP), a virtual relative position based routing protocol for sensor networks that also provides methods for data management as known from standar...
VTC
2007
IEEE
14 years 2 months ago
2007
IEEE
— A low complexity frequency domain iterative decision-directed channel estimation (FD-IDDCE) technique for single-carrier (SC) systems with frequency domain multiplexed (FDM) pi...