Sciweavers

1055 search results - page 108 / 211
» Enumerations in computable structure theory
Sort
View
AAAI
2011
14 years 4 months ago
Analogical Dialogue Acts: Supporting Learning by Reading Analogies in Instructional Texts
Analogy is heavily used in instructional texts. We introduce the concept of analogical dialogue acts (ADAs), which represent the roles utterances play in instructional analogies. ...
David Michael Barbella, Kenneth D. Forbus
IFIP
2004
Springer
15 years 9 months ago
New-HOPLA: A Higher-order Process Language with Name Generation
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
Glynn Winskel, Francesco Zappa Nardelli
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 4 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ICPR
2006
IEEE
16 years 5 months ago
Motion Features from Lip Movement for Person Authentication
This paper describes a new motion based feature extraction technique for speaker identification using orientation estimation in 2D manifolds. The motion is estimated by computing ...
Josef Bigün, Maycel Isaac Faraj
SAC
2006
ACM
15 years 10 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ï¬...
Sylvie Boldo, César Muñoz