Sciweavers

2877 search results - page 310 / 576
» The Complexity of Planarity Testing
Sort
View
IJCAI
2007
15 years 8 months ago
Learning to Count by Think Aloud Imitation
Although necessary, learning to discover new solutions is often long and difficult, even for supposedly simple tasks such as counting. On the other hand, learning by imitation pr...
Laurent Orseau
LREC
2008
105views Education» more  LREC 2008»
15 years 8 months ago
Extraction and Evaluation of Keywords from Learning Objects: a Multilingual Approach
We report about a project which brings together Natural Language Processing and eLearning. One of the functionalities developed within this project is the possibility to annotate ...
Lothar Lemnitzer, Paola Monachesi
NIPS
2008
15 years 8 months ago
Evaluating probabilities under high-dimensional latent variable models
We present a simple new Monte Carlo algorithm for evaluating probabilities of observations in complex latent variable models, such as Deep Belief Networks. While the method is bas...
Iain Murray, Ruslan Salakhutdinov
ISIM
2007
15 years 8 months ago
Using Matrix Decompositions in Formal Concept Analysis
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
Václav Snásel, Petr Gajdos, Hussam M...
NIPS
2007
15 years 8 months ago
Object Recognition by Scene Alignment
Current object recognition systems can only recognize a limited number of object categories; scaling up to many categories is the next challenge. We seek to build a system to reco...
Bryan C. Russell, Antonio Torralba, Ce Liu, Robert...