Sciweavers

323 search results - page 33 / 65
» Learning nonsingular phylogenies and hidden Markov models
Sort
View
KBSE
2009
IEEE
14 years 3 months ago
Code Completion from Abbreviated Input
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
Sangmok Han, David R. Wallace, Robert C. Miller
ICIP
2002
IEEE
14 years 10 months ago
Unsupervised image segmentation via Markov trees and complex wavelets
The goal in image segmentation is to label pixels in an image based on the properties of each pixel and its surrounding region. Recently Content-Based Image Retrieval (CBIR) has e...
Cián W. Shaffrey, Ian Jermyn, Nick G. Kings...
CVPR
2012
IEEE
11 years 11 months ago
Learning latent temporal structure for complex event detection
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
Kevin Tang, Fei-Fei Li, Daphne Koller
IJCAI
1997
13 years 9 months ago
Learning Topological Maps with Weak Local Odometric Information
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...
Hagit Shatkay, Leslie Pack Kaelbling
CVPR
2007
IEEE
14 years 10 months ago
Latent-Dynamic Discriminative Models for Continuous Gesture Recognition
Many problems in vision involve the prediction of a class label for each frame in an unsegmented sequence. In this paper, we develop a discriminative framework for simultaneous se...
Louis-Philippe Morency, Ariadna Quattoni, Trevor D...