253 search results - page 37 / 51 » Perfection thickness of graphs |
126
click to vote
COMBINATORICS
1999
15 years 4 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...
130
click to vote
CC
2007
Springer
15 years 10 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 ...
128
click to vote
GD
2009
Springer
15 years 9 months 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...
127
click to vote
PKDD
2009
Springer
15 years 11 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...
139
click to vote
CSCW
2006
ACM
15 years 10 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 ...