Sciweavers

3267 search results - page 376 / 654
» Generalized quasirandom graphs
Sort
View
JDA
2006
184views more  JDA 2006»
15 years 6 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
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...
Camil Demetrescu, Giuseppe F. Italiano
ENDM
2007
106views more  ENDM 2007»
15 years 6 months ago
Removing Even Crossings on Surfaces
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
JSAC
1998
126views more  JSAC 1998»
15 years 6 months ago
Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
Frank R. Kschischang, Brendan J. Frey
EJC
2008
15 years 6 months ago
A simple proof for open cups and caps
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
Jakub Cerný
ICCD
2000
IEEE
116views Hardware» more  ICCD 2000»
16 years 3 months ago
Representing and Scheduling Looping Behavior Symbolically
This paper presents a very general, exact technique for scheduling looping data-flow graphs. In contrast to the conventional technique using loop iteration variables and integer ...
Steve Haynal, Forrest Brewer