84 search results - page 6 / 17 » Minimax Trees in Linear Time with Applications |
KDD
2007
ACM
14 years 8 months ago
2007
ACM
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...
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
The paper deals with the problem of reconstructing the tree-like topological structure of a network of linear dynamical systems. A distance function is defined in order to evaluat...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
Recent advancement in peer-to-peer (P2P) technologies has enabled a wide range of new applications. In this paper, we present mixed integer programming (MIP) formulations to analy...
COMPGEOM
2010
ACM
14 years 21 days ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
ECSQARU
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...