Sciweavers

2835 search results - page 431 / 567
» Automatic Question Answering
Sort
View
ECCC
2000
158views more  ECCC 2000»
15 years 6 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
CORR
2002
Springer
110views Education» more  CORR 2002»
15 years 6 months ago
Long Proteins with Unique Optimal Foldings in the H-P Model
It is widely accepted that (1) the natural or folded state of proteins is a global energy minimum, and (2) in most cases proteins fold to a unique state determined by their amino ...
Oswin Aichholzer, David Bremner, Erik D. Demaine, ...
ENTCS
2002
148views more  ENTCS 2002»
15 years 6 months ago
A Declarative Debugging System for Lazy Functional Logic Programs
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
Rafael Caballero, Mario Rodríguez-Artalejo
ENTCS
2002
61views more  ENTCS 2002»
15 years 6 months ago
Effectively Absolute Continuity and Effective Jordan Decomposability
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled Jorda...
Xizhong Zheng, Robert Rettinger, Burchard von Brau...
JILP
2000
103views more  JILP 2000»
15 years 6 months ago
Comparing and Combining Profiles
How much do two profiles of the same program differ? When has a profile changed enough to warrant reexamination of the profiled program? And how should two or more profiles be com...
Serap A. Savari, Cliff Young