Sciweavers

134 search results - page 7 / 27
» An Optimal Rebuilding Strategy for an Incremental Tree Probl...
Sort
View
AAAI
1997
15 years 2 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
ICALP
2007
Springer
15 years 7 months ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 1 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
ICASSP
2009
IEEE
15 years 8 months ago
A framework for distributed multimedia stream mining systems using coalition-based foresighted strategies
In this paper, we propose a distributed solution to the problem of configuring classifier trees in distributed stream mining systems. The configuration involves selecting appro...
Hyunggon Park, Deepak S. Turaga, Olivier Verscheur...
SENSYS
2010
ACM
14 years 11 months ago
Estimating building consumption breakdowns using ON/OFF state sensing and incremental sub-meter deployment
This paper considers the problem of estimating the power breakdowns for the main appliances inside a building using a small number of power meters and the knowledge of the ON/OFF ...
Deokwoo Jung, Andreas Savvides