Sciweavers

1224 search results - page 59 / 245
» Theory decision by decomposition
Sort
View
146
Voted
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
15 years 5 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...
94
Voted
IJAR
2007
87views more  IJAR 2007»
15 years 18 days ago
Pruning belief decision tree methods in averaging and conjunctive approaches
The belief decision tree (BDT) approach is a decision tree in an uncertain environment where the uncertainty is represented through the Transferable Belief Model (TBM), one interp...
Salsabil Trabelsi, Zied Elouedi, Khaled Mellouli
FSTTCS
2004
Springer
15 years 6 months ago
Decidability of MSO Theories of Tree Structures
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
Angelo Montanari, Gabriele Puppis
94
Voted
DATESO
2008
129views Database» more  DATESO 2008»
15 years 2 months ago
Database Engineering from the Category Theory Viewpoint
Abstract. This paper gives an overview of XML formal models, summarizes database engineering practices, problems and their evolution. We focus on categorical aspects of XML formal ...
David Toth
99
Voted
STOC
1992
ACM
110views Algorithms» more  STOC 1992»
15 years 4 months ago
Linear Decision Trees: Volume Estimates and Topological Bounds
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
Anders Björner, László Lov&aacu...