Sciweavers

1957 search results - page 212 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
153
Voted
KDD
2000
ACM
168views Data Mining» more  KDD 2000»
15 years 9 months ago
Scaling up dynamic time warping for datamining applications
There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of ...
Eamonn J. Keogh, Michael J. Pazzani
COSIT
1995
Springer
103views GIS» more  COSIT 1995»
15 years 9 months ago
On the Determination of the Optimum Path in Space
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
Emmanuel Stefanakis, Marinos Kavouras
FLAIRS
2008
15 years 8 months ago
Learning Continuous Action Models in a Real-Time Strategy Environment
Although several researchers have integrated methods for reinforcement learning (RL) with case-based reasoning (CBR) to model continuous action spaces, existing integrations typic...
Matthew Molineaux, David W. Aha, Philip Moore
DAGSTUHL
2007
15 years 7 months ago
Matrix Analytic Methods in Branching processes
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
Sophie Hautphenne, Guy Latouche, Marie-Ange Remich...
155
Voted
UAI
2008
15 years 7 months ago
Observation Subset Selection as Local Compilation of Performance Profiles
Deciding what to sense is a crucial task, made harder by dependencies and by a nonadditive utility function. We develop approximation algorithms for selecting an optimal set of me...
Yan Radovilsky, Solomon Eyal Shimony