Sciweavers

210 search results - page 42 / 42
» A Formal Theory of Key Conjuring
Sort
View
FLAIRS
2008
13 years 9 months ago
Learning a Probabilistic Model of Event Sequences from Internet Weblog Stories
One of the central problems in building broad-coverage story understanding systems is generating expectations about event sequences, i.e. predicting what happens next given some a...
Mehdi Manshadi, Reid Swanson, Andrew S. Gordon
IWC
2008
99views more  IWC 2008»
13 years 7 months ago
Pedagogy and usability in interactive algorithm visualizations: Designing and evaluating CIspace
Interactive algorithm visualizations (AVs) are powerful tools for teaching and learning concepts that are difficult to describe with static media alone. However, while countless A...
Saleema Amershi, Giuseppe Carenini, Cristina Conat...
IJCINI
2007
110views more  IJCINI 2007»
13 years 7 months ago
Toward Autonomic Computing: Adaptive Neural Network for Trajectory Planning
: The theme of this issue of IJCINI is on cognitive mechanisms of autonomic computing and laws of human cooperative work organization. This editorial addresses key notions of this ...
Amar Ramdane-Cherif
TCS
2008
13 years 7 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
IPL
2007
105views more  IPL 2007»
13 years 7 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk