Sciweavers

69 search results - page 8 / 14
» Fully Deadline-Coupled Planning: One Step at a Time
Sort
View
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
15 years 9 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
BILDMED
2006
113views Algorithms» more  BILDMED 2006»
14 years 10 months ago
Automatic Segmentation of the Vessel Lumen from 3D CTA Images of Aortic Dissection
Acute aortic dissection is a life-threatening condition and must be diagnosed and treated promptly. For treatment planning the reliable identification of the true and false lumen i...
Tamás Kovács, Philippe C. Cattin, Ha...
CRV
2005
IEEE
272views Robotics» more  CRV 2005»
14 years 11 months ago
Real-Time Video Surveillance with Self-Organizing Maps
In this paper, we present an approach for video surveillance involving (a) moving object detection, (b) tracking and (c) normal/abnormal event recognition. The detection step uses...
Mohamed Dahmane, Jean Meunier
CI
2005
106views more  CI 2005»
14 years 9 months ago
Incremental Learning of Procedural Planning Knowledge in Challenging Environments
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...
Douglas J. Pearson, John E. Laird
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
15 years 3 months ago
Dynamic Highway-Node Routing
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
Dominik Schultes, Peter Sanders