2612 search results - page 364 / 523 » Switching Graphs and Their Complexity |
131
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
126
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents a complex systems overview of a power grid network under cascading conditions. The cascading effect has been simulated on three different networks, the IEEE 300...
157
Voted
CVIU
2008
15 years 4 months ago
2008
We present a new noise model for color channels for statistical change detection. Based on this noise modeling, we estimate the distribution of Euclidean distances between the pix...
131
click to vote
ENTCS
2010
15 years 4 months ago
2010
Process modeling languages such as "Dynamical Grammars" are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can b...
121
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...