336 search results - page 4 / 68 » Improved data structures for fully dynamic biconnectivity |
ISCAS
2007
IEEE
15 years 6 months ago
2007
IEEE
— Quadrature Σ∆ ADCs require a feedback path for both the I and the Q part of the complex feedback signal. A complex DAC could give this feedback with near-perfect I/Q balance...
184
click to vote
LCPC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Data copy is an important compiler optimization which dynamically rearranges the layout of arrays by copying their elements into local buffers. Traditionally, array copy...
STOC
2003
ACM
15 years 12 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
129
click to vote
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
103
click to vote
JDA
2006
14 years 11 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...