Sciweavers

1923 search results - page 120 / 385
» Weighted Decision Trees
Sort
View
AIPS
2011
14 years 10 months ago
Sample-Based Planning for Continuous Action Markov Decision Processes
In this paper, we present a new algorithm that integrates recent advances in solving continuous bandit problems with sample-based rollout methods for planning in Markov Decision P...
Christopher R. Mansley, Ari Weinstein, Michael L. ...
CATS
2008
15 years 7 months ago
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
DMIN
2009
136views Data Mining» more  DMIN 2009»
15 years 4 months ago
Evaluating Algorithms for Concept Description
When performing concept description, models need to be evaluated both on accuracy and comprehensibility. A comprehensible concept description model should present the most importan...
Cecilia Sönströd, Ulf Johansson, Tuve L&...
IJCAI
2007
15 years 7 months ago
Dynamically Weighted Hidden Markov Model for Spam Deobfuscation
Spam deobfuscation is a processing to detect obfuscated words appeared in spam emails and to convert them back to the original words for correct recognition. Lexicon tree hidden M...
Seunghak Lee, Iryoung Jeong, Seungjin Choi
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
15 years 7 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth