Sciweavers

2498 search results - page 262 / 500
» Data Structures with Unpredictable Timing
Sort
View
NAACL
2001
15 years 8 months ago
A Probabilistic Earley Parser as a Psycholinguistic Model
In human sentence processing, cognitive load can be defined many ways. This report considers a definition of cognitive load in terms of the total probability of structural options...
John Hale
CASCON
1993
117views Education» more  CASCON 1993»
15 years 8 months ago
Documenting-in-the-large vs. documenting-in-the-small
There is a signi cant di erence between documentinglarge programs and documenting small ones. By large programs we mean on the order of 1,000,000 lines, usually written by many di...
Scott R. Tilley
NIPS
1996
15 years 7 months ago
Hidden Markov Decision Trees
We study a time series model that can be viewed as a decision tree with Markov temporal structure. The model is intractable for exact calculations, thus we utilize variational app...
Michael I. Jordan, Zoubin Ghahramani, Lawrence K. ...
LISP
2008
104views more  LISP 2008»
15 years 6 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
ICRA
2010
IEEE
79views Robotics» more  ICRA 2010»
15 years 5 months ago
Robot pebbles: One centimeter modules for programmable matter through self-disassembly
— This paper describes the design, fabrication, and experimental results of a programmable matter system capable of 2D shape formation through subtraction. The system is composed...
Kyle Gilpin, Ara Knaian, Daniela Rus