Sciweavers

541 search results - page 38 / 109
» An Efficient Algorithm for the Longest Pattern Subsequence P...
Sort
View
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
14 years 9 months ago
Probabilistic discovery of time series motifs
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
Bill Yuan-chi Chiu, Eamonn J. Keogh, Stefano Lonar...
CVPR
2008
IEEE
14 years 10 months ago
Efficient sequential correspondence selection by cosegmentation
In many retrieval, object recognition and wide baseline stereo methods, correspondences of interest points are established possibly sublinearly by matching a compact descriptor su...
Jan Cech, Jiri Matas, Michal Perdoch
ICRA
2010
IEEE
136views Robotics» more  ICRA 2010»
13 years 6 months ago
Efficient planning under uncertainty for a target-tracking micro-aerial vehicle
A helicopter agent has to plan trajectories to track multiple ground targets from the air. The agent has partial information of each target's pose, and must reason about its u...
Ruijie He, Abraham Bachrach, Nicholas Roy
BIBM
2009
IEEE
190views Bioinformatics» more  BIBM 2009»
13 years 6 months ago
A Fast, Semi-automatic Brain Structure Segmentation Algorithm for Magnetic Resonance Imaging
Abstract--Medical image segmentation has become an essential technique in clinical and research-oriented applications. Because manual segmentation methods are tedious, and fully au...
Kevin Karsch, Qing He, Ye Duan
ALT
2003
Springer
14 years 13 days ago
Can Learning in the Limit Be Done Efficiently?
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
Thomas Zeugmann