Sciweavers

222 search results - page 30 / 45
» E-Matching with Free Variables
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
Shaojun Wang, Shaomin Wang, Russell Greiner, Dale ...
ICFP
2005
ACM
14 years 7 months ago
Scrap your nameplate: (functional pearl)
Recent research has shown how boilerplate code, or repetitive code for traversing datatypes, can be eliminated using generic programming techniques already available within some i...
James Cheney
LICS
2009
IEEE
14 years 2 months ago
Indexed Containers
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
Thorsten Altenkirch, Peter Morris
CPAIOR
2009
Springer
14 years 2 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
ICRA
2008
IEEE
179views Robotics» more  ICRA 2008»
14 years 2 months ago
How can human motion prediction increase transparency?
—A major issue in the field of human-robot interaction for assistance to manipulation is transparency. This basic feature qualifies the capacity for a robot to follow human mov...
Nathanaël Jarrassé, Jamie Paik, Vivian...