Sciweavers

9532 search results - page 1820 / 1907
» Logic, Graphs, and Algorithms
Sort
View
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 3 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...
ICDT
2010
ACM
180views Database» more  ICDT 2010»
15 years 3 months ago
Composing local-as-view mappings: closure and applications
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia C. Arocena, Ariel Fuxman, Renée J....
ALT
1995
Springer
15 years 2 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
TACAS
2000
Springer
149views Algorithms» more  TACAS 2000»
15 years 2 months ago
Proof General: A Generic Tool for Proof Development
This note describes Proof General, a tool for developing machine proofs with an interactive proof assistant. Interaction is based around a proof script, which is the target of a pr...
David Aspinall
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 2 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
« Prev « First page 1820 / 1907 Last » Next »