Sciweavers

1949 search results - page 93 / 390
» Random graphs on surfaces
Sort
View
COMBINATORICS
2006
110views more  COMBINATORICS 2006»
15 years 4 months ago
Jamming and Geometric Representations of Graphs
We expose a relationship between jamming and a generalization of Tutte's barycentric embedding. This provides a basis for the systematic treatment of jamming and maximal packi...
Werner Krauth, Martin Loebl
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
15 years 11 months ago
New simulation methodology of 3D surface roughness loss for interconnects modeling
— As clock frequencies exceed giga-Hertz, the extra power loss due to conductor surface roughness in interconnects and packagings is more evident and thus demands a proper accou...
Quan Chen, Ngai Wong
ICCTA
2007
IEEE
15 years 8 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
ICPR
2010
IEEE
15 years 6 months ago
A Compound MRF Texture Model
—This paper describes a novel compound Markov random field model capable of realistic modelling of multispectral bidirectional texture function, which is currently the most adva...
Michael Haindl, Vojtech Havlicek
CORR
2006
Springer
95views Education» more  CORR 2006»
15 years 4 months ago
Naming Games in Spatially-Embedded Random Networks
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
Qiming Lu, Gyorgy Korniss, Boleslaw K. Szymanski