253 search results - page 37 / 51 » Perfection thickness of graphs |
COMBINATORICS
1999
13 years 7 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
CC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
GD
2009
Springer
14 years 17 hour ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
PKDD
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...
CSCW
2006
ACM
14 years 1 months ago
2006
ACM
The CSCW conference is celebrating its 20th birthday. This is a perfect time to analyze the coherence of the field, to examine whether it has a solid core or sub-communities, and ...