Sciweavers

54 search results - page 2 / 11
» Estimating the number of vertices of a polyhedron
Sort
View
FMSD
2006
104views more  FMSD 2006»
13 years 5 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
DMTCS
2010
145views Mathematics» more  DMTCS 2010»
13 years 2 months ago
Asymptotic enumeration of orientations
We find the asymptotic number of 2-orientations of quadrangulations with n inner faces, and of 3orientations of triangulations with n inner vertices. We also find the asymptotic n...
Stefan Felsner, Éric Fusy, Marc Noy
CPC
2010
117views more  CPC 2010»
13 years 2 months ago
On the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
RSA
2010
64views more  RSA 2010»
13 years 3 months ago
Vertices of given degree in series-parallel graphs
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...
Michael Drmota, Omer Giménez, Marc Noy
ICCD
2004
IEEE
119views Hardware» more  ICCD 2004»
14 years 2 months ago
Simultaneous Scheduling, Binding and Layer Assignment for Synthesis of Vertically Integrated 3D Systems
Three dimensional vertically integrated systems allow active devices to be placed on multiple device layers. In recent years, a number of research efforts have addressed physical ...
Madhubanti Mukherjee, Ranga Vemuri