Sciweavers

2022 search results - page 140 / 405
» Complexity of Non-Monotonic Logics
Sort
View
169
Voted
TE
2010
104views more  TE 2010»
15 years 1 months ago
Integrating Asynchronous Digital Design Into the Computer Engineering Curriculum
Abstract--As demand increases for circuits with higher performance, higher complexity, and decreased feature size, asynchronous (clockless) paradigms will become more widely used i...
Scott C. Smith, Waleed Al-Assadi, Jia Di
LICS
2012
IEEE
13 years 9 months ago
An Automata Model for Trees with Ordered Data Values
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Tony Tan
LOPSTR
2005
Springer
16 years 3 days ago
Declarative Programming with Function Patterns
We propose an extension of functional logic languages that allows the definition of operations with patterns containing other defined operation symbols. Such “function patterns...
Sergio Antoy, Michael Hanus
ADC
2006
Springer
128views Database» more  ADC 2006»
16 years 18 days ago
Horn clauses and functional dependencies in complex-value databases
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
Sven Hartmann, Sebastian Link
ICDAR
2005
IEEE
16 years 6 days ago
A Statistical Learning Approach To Document Image Analysis
In the field of computer analysis of document images, the problems of physical and logical layout analysis have been approached through a variety of heuristic, rule-based, and gr...
Kevin Laven, Scott Leishman, Sam T. Roweis