Sciweavers

3378 search results - page 4 / 676
» A universe of binding and computation
Sort
View
COLING
1994
13 years 8 months ago
Universal Guides And Finiteness And Symmetry Of Grammar Processing Algorithms
This paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing variable binding status) in order to chara...
Miroslav Martinovic
LICS
2008
IEEE
14 years 1 months ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
EUROCRYPT
2001
Springer
13 years 12 months ago
How to Convert the Flavor of a Quantum Bit Commitment
In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealin...
Claude Crépeau, Frédéric L&ea...
RECOMB
2007
Springer
14 years 7 months ago
A Feature-Based Approach to Modeling Protein-DNA Interactions
Transcription factor (TF) binding to its DNA target site is a fundamental regulatory interaction. The most common model used to represent TF binding specificities is a position spe...
Eilon Sharon, Eran Segal
ICASSP
2008
IEEE
14 years 1 months ago
Modeling regulatory sites with higher order position-dependent weight matrices
Identification of regulatory signals in DNA depends on the nature and quality of the patterns of representative sequences. These patterns are constructed from training sets of se...
Hossein Zare, Mostafa Kaveh, Arkady B. Khodursky