1220 search results - page 121 / 244 » Minimal Interval Completions |
CPC
2004
13 years 9 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
ET
2000
13 years 9 months ago
2000
: We present a method for obtaining a minimal set of test configurations and their associated set oftest patterns that completely tests re-programmable Programmable Logic Arrays (P...
IJCV
2000
13 years 9 months ago
2000
We address the structure-from-motionproblem in the context of head modeling from video sequences for which calibration data is not available. This task is made challenging by the ...
JGAA
2000
13 years 9 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
MP
1998
13 years 8 months ago
1998
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...