317 search results - page 26 / 64 » Factoring logic functions using graph partitioning |
CIE
2008
Springer
14 years 11 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
77
Voted
TMI
2008
14 years 9 months ago
2008
Contrast-enhanced magnetic resonance imaging (MRI) is useful to study the infiltration of cells in vivo. This research adopts ultrasmall superparamagnetic iron oxide (USPIO) parti...
107
click to vote
PAMI
2007
14 years 9 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
PPDP
2007
Springer
15 years 3 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. The payoff received by the controller can be evaluated in different ways, dep...