Sciweavers

121 search results - page 15 / 25
» Algorithms for optimal dyadic decision trees
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Stochastic Steiner Trees Without a Root
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
Anupam Gupta, Martin Pál
DSN
2009
IEEE
13 years 5 months ago
RRE: A game-theoretic intrusion Response and Recovery Engine
Preserving the availability and integrity of networked computing systems in the face of fast-spreading intrusions requires advances not only in detection algorithms, but also in a...
Saman A. Zonouz, Himanshu Khurana, William H. Sand...
KDD
1997
ACM
122views Data Mining» more  KDD 1997»
14 years 3 days ago
Computing Optimized Rectilinear Regions for Association Rules
We address the problem of nding useful regions for two-dimensional association rules and decision trees. In a previous paper we presented ecient algorithms for computing optimiz...
Kunikazu Yoda, Takeshi Fukuda, Yasuhiko Morimoto, ...
AAAI
2006
13 years 9 months ago
Targeting Specific Distributions of Trajectories in MDPs
We define TTD-MDPs, a novel class of Markov decision processes where the traditional goal of an agent is changed from finding an optimal trajectory through a state space to realiz...
David L. Roberts, Mark J. Nelson, Charles Lee Isbe...
DATAMINE
2002
125views more  DATAMINE 2002»
13 years 7 months ago
High-Performance Commercial Data Mining: A Multistrategy Machine Learning Application
We present an application of inductive concept learning and interactive visualization techniques to a large-scale commercial data mining project. This paper focuses on design and c...
William H. Hsu, Michael Welge, Thomas Redman, Davi...