Sciweavers

3265 search results - page 295 / 653
» Representing Groups on Graphs
Sort
View
193
Voted
CGF
2008
110views more  CGF 2008»
15 years 6 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl
IJES
2006
72views more  IJES 2006»
15 years 6 months ago
Non-contiguous linear placement for reconfigurable fabrics
: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabr...
Cristinel Ababei, Kia Bazargan
JMLR
2006
113views more  JMLR 2006»
15 years 6 months ago
Learning the Structure of Linear Latent Variable Models
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...
Ricardo Silva, Richard Scheines, Clark Glymour, Pe...
160
Voted
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
15 years 6 months ago
Map Genus, Forbidden Maps, and Monadic Second-Order Logic
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
Bruno Courcelle, V. Dussaux
SIVP
2010
118views more  SIVP 2010»
15 years 5 months ago
Self-organization of sensor networks for detection of pervasive faults
Resource aware operation of sensor networks requires adaptive re-organization to dynamically adapt to the operational environment. A complex dynamical system of interacting compone...
Abhishek Srivastav, Asok Ray