Sciweavers

1224 search results - page 35 / 245
» Theory decision by decomposition
Sort
View
RSCTC
2000
Springer
144views Fuzzy Logic» more  RSCTC 2000»
14 years 1 months ago
Valued Tolerance and Decision Rules
In this paper we introduce the concept of valued tolerance as an extension of the usual concept of indiscernibility (which is a crisp equivalence relation) in rough sets theory. So...
Jerzy Stefanowski, Alexis Tsoukiàs
CADE
2012
Springer
12 years 8 days ago
Combination of Disjoint Theories: Beyond Decidability
Combination of theories underlies the design of satisfiability modulo theories (SMT) solvers. The Nelson-Oppen framework can be used to build a decision procedure for the combinat...
Pascal Fontaine, Stephan Merz, Christoph Weidenbac...
ICASSP
2011
IEEE
13 years 1 months ago
Generalized geometric mean decomposition and DFE MMSE transceiver design for cyclic prefix systems
This paper considers the decomposition of a complex matrix as the product of several sets of semi-unitary matrices and upper triangular matrices in iterative manner. The inner mos...
Chih-Hao Liu, Palghat P. Vaidyanathan
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 10 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 4 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie