2125 search results - page 189 / 425 » On Graph Complexity |
121
click to vote
CSCLP
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
127
click to vote
ICCD
1995
IEEE
15 years 6 months ago
1995
IEEE
Optimization of hardware resources for conditional data-flow graph behavior is particularly important when conditional behavior occurs in cyclic loops and maximization of through...
115
click to vote
NIPS
2003
15 years 4 months ago
2003
We consider the question of how well a given distribution can be approximated with probabilistic graphical models. We introduce a new parameter, effective treewidth, that captures...
148
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
115
click to vote
EMNLP
2009
15 years 25 days ago
2009
We present an inexact search algorithm for the problem of predicting a two-layered dependency graph. The algorithm is based on a k-best version of the standard cubictime search al...