Sciweavers

4860 search results - page 358 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
124
Voted
EMNLP
2008
15 years 5 months ago
Understanding the Value of Features for Coreference Resolution
In recent years there has been substantial work on the important problem of coreference resolution, most of which has concentrated on the development of new models and algorithmic...
Eric Bengtson, Dan Roth
ICTAI
2005
IEEE
15 years 9 months ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet
AAI
2006
71views more  AAI 2006»
15 years 3 months ago
Textual Article Clustering in Newspaper Pages
In the analysis of a newspaper page an important step is the clustering of various text blocks into logical units, i.e., into articles. We propose three algorithms based on text p...
Marco Aiello, Andrea Pegoretti
RAS
2006
92views more  RAS 2006»
15 years 3 months ago
Trajectory generation and control for four wheeled omnidirectional vehicles
This paper describes an algorithm to calculate near-optimal minimum time trajectories for four wheeled omnidirectional vehicles, which can be used as part of a high-level path pla...
Oliver Purwin, Raffaello D'Andrea
WACV
2012
IEEE
13 years 11 months ago
Online discriminative object tracking with local sparse representation
We propose an online algorithm based on local sparse representation for robust object tracking. Local image patches of a target object are represented by their sparse codes with a...
Qing Wang, Feng Chen, Wenli Xu, Ming-Hsuan Yang