Sciweavers

57 search results - page 8 / 12
» Pebbling and Branching Programs Solving the Tree Evaluation ...
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 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
VLDB
2005
ACM
134views Database» more  VLDB 2005»
14 years 1 months ago
MDL Summarization with Holes
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
14 years 4 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
ISBI
2011
IEEE
12 years 11 months ago
Reliable cell tracking by global data association
Automated cell tracking in populations is important for research and discovery in biology and medicine. In this paper, we propose a cell tracking method based on global spatiotemp...
Ryoma Bise, Zhaozheng Yin, Takeo Kanade
CN
2007
154views more  CN 2007»
13 years 7 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...