Sciweavers

813 search results - page 64 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
EJC
2011
13 years 4 months ago
Distributive lattices, polyhedra, and generalized flows
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
Stefan Felsner, Kolja B. Knauer
TCOM
2011
170views more  TCOM 2011»
13 years 4 months ago
On Girth Conditioning for Low-Density Parity-Check Codes
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
Samuele Bandi, Velio Tralli, Andrea Conti, Maddale...
SAC
2011
ACM
13 years 23 hour ago
A semantically rich approach for collaborative model edition
We propose a novel approach and tool for collaborative software engineering and development. In model-based software engineering, the underlying data structure is a complex, direc...
Jonathan Michaux, Xavier Blanc, Marc Shapiro, Pier...
ETFA
2008
IEEE
14 years 3 months ago
Automatic generation of bond graph models of process plants
This paper presents an application for the automatic generation of Bond Graph models. The basis for this automated creation is a modified plant model in the XML-format according t...
Sebastian Beez, Alexander Fay, Nina F. Thornhill
SDM
2010
SIAM
182views Data Mining» more  SDM 2010»
13 years 10 months ago
HCDF: A Hybrid Community Discovery Framework
We introduce a novel Bayesian framework for hybrid community discovery in graphs. Our framework, HCDF (short for Hybrid Community Discovery Framework), can effectively incorporate...
Keith Henderson, Tina Eliassi-Rad, Spiros Papadimi...