1159 search results - page 79 / 232 » Binary Decision Graphs |
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
ENTCS
2006
13 years 10 months ago
2006
We are using ML to build a compiler that does low-level optimization. To support optimizations in classic imperative style, we built a control-flow graph using mutable pointers an...
CVPR
2005
IEEE
15 years 6 days ago
2005
IEEE
We propose using simple mixture models to define a set of mid-level binary local features based on binary oriented edge input. The features capture natural local structures in the...
ISSRE
2006
IEEE
14 years 4 months ago
2006
IEEE
The benefits that a software organization obtains from estimates of product quality are dependent upon how early in the product cycle that these estimates are available. Early est...
ICALP
1995
Springer
14 years 1 months ago
1995
Springer
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...