1159 search results - page 144 / 232 » Binary Decision Graphs |
159
click to vote
PDPTA
2003
15 years 6 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
146
Voted
AIPS
2009
15 years 6 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
143
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
148
Voted
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
We describe an energy minimization algorithm for functions defined on 4-connected lattices, of the type usually encountered in problems involving images. Such functions are often ...
158
click to vote
CORR
2011
Springer
15 years 16 days ago
2011
Springer
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs – secure function evaluation (SFE) and differential...