Sciweavers

343 search results - page 36 / 69
» Normal Forms in Function Fields
Sort
View
ACSC
2004
IEEE
15 years 1 months ago
Self-Replicating Expressions in the Lambda Calculus
The study of self-replicating structures in Computer Science has been taking place for more than half a century, motivated by the desire to understand the fundamental principles a...
James Larkin, Phil Stocks
IJCAI
2007
14 years 11 months ago
Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs
Compiling Bayesian networks (BNs) is one of the hot topics in the area of probabilistic modeling and processing. In this paper, we propose a new method of compiling BNs into multi...
Shin-ichi Minato, Ken Satoh, Taisuke Sato
DAC
2004
ACM
15 years 10 months ago
A new heuristic algorithm for reversible logic synthesis
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
Pawel Kerntopf
IJCV
1998
192views more  IJCV 1998»
14 years 9 months ago
What Is the Set of Images of an Object Under All Possible Illumination Conditions?
The appearance of an object depends on both the viewpoint from which it is observed and the light sources by which it is illuminated. If the appearance of two objects is never iden...
Peter N. Belhumeur, David J. Kriegman
ICALP
2000
Springer
15 years 1 months ago
On the Power of Tree-Walking Automata
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
Frank Neven, Thomas Schwentick