Sciweavers

4488 search results - page 276 / 898
» Properties of NP-Complete Sets
Sort
View
ICCAD
1996
IEEE
127views Hardware» more  ICCAD 1996»
15 years 11 months ago
Comparing models of computation
We give a denotational framework (a "meta model") within which certain properties of models of computation can be understood and compared. It describes concurrent proces...
Edward A. Lee, Alberto L. Sangiovanni-Vincentelli
PLILP
1993
Springer
15 years 11 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
KAIS
2000
86views more  KAIS 2000»
15 years 6 months ago
A Mathematical Foundation for Improved Reduct Generation in Information Systems
When data sets are analyzed, statistical pattern recognition is often used to find the information hidden in the data. Another approach to information discovery is data mining. Dat...
Janusz A. Starzyk, Dale E. Nelson, Kirk Sturtz
JMIV
2010
131views more  JMIV 2010»
15 years 5 months ago
An SL(2) Invariant Shape Median
Median averaging is a powerful averaging concept on sets of vector data in finite dimensions. A generalization of the median for shapes in the plane is introduced. The underlying ...
Benjamin Berkels, Gina Linkmann, Martin Rumpf
FSTTCS
2010
Springer
15 years 4 months ago
Parityizing Rabin and Streett
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
Udi Boker, Orna Kupferman, Avital Steinitz