11565 search results - page 169 / 2313 » Computing Minimal Mappings |
111
click to vote
ISCAS
1999
IEEE
15 years 8 months ago
1999
IEEE
Modem computer and communication system design has to consider the timing constraints imposed by communication and system pipelines, and minimize the energy consumption. We adopt ...
113
click to vote
IPL
2008
15 years 4 months ago
2008
Given an arbitrary graph G = (V, E) and a proper interval graph H = (V, F) with E F we say that H is a proper interval completion of G. The graph H is called a minimal proper inte...
119
click to vote
JCB
2008
15 years 4 months ago
2008
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock out sets of reactions required to block a given behaviour....
139
click to vote
AAAI
2000
15 years 5 months ago
2000
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
166
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...