1653 search results - page 250 / 331 » Directed tree-width examples |
142
click to vote
SIGGRAPH
1999
ACM
15 years 9 months ago
1999
ACM
We present a new method for user controlled morphing of two homeomorphic triangle meshes of arbitrary topology. In particular we focus on the problem of establishing a corresponde...
139
click to vote
ESA
1999
Springer
15 years 9 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
118
click to vote
PEPM
1994
ACM
15 years 9 months ago
1994
ACM
It is well-known that self-applicable partial evaluation can be used to generate compiler generators: cogen = mix(mix;mix), where mix is the specializer (partial evaluator). Howev...
118
click to vote
ICML
1989
IEEE
15 years 8 months ago
1989
IEEE
The training experiences needed by a learning system may be selected by either an external agent or the system itself. We show that knowledge of the current state of the learner&#...
156
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...