Sciweavers

205 search results - page 13 / 41
» Decision trees do not generalize to new variations
Sort
View
WAOA
2005
Springer
112views Algorithms» more  WAOA 2005»
14 years 2 months ago
Partial Multicuts in Trees
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
Asaf Levin, Danny Segev
ATAL
2011
Springer
12 years 8 months ago
Information elicitation for decision making
Proper scoring rules, particularly when used as the basis for a prediction market, are powerful tools for eliciting and aggregating beliefs about events such as the likely outcome...
Yiling Chen, Ian A. Kash
GLVLSI
2009
IEEE
123views VLSI» more  GLVLSI 2009»
14 years 3 months ago
Power efficient tree-based crosslinks for skew reduction
Clock distribution networks are an important design issue that is highly dependent on delay variations and load imbalances, while requiring power efficiency. Existing mesh solutio...
Inna Vaisband, Ran Ginosar, Avinoam Kolodny, Eby G...
ICCV
2005
IEEE
14 years 10 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu
DATE
2008
IEEE
78views Hardware» more  DATE 2008»
14 years 3 months ago
Transistor-Specific Delay Modeling for SSTA
SSTA has received a considerable amount of attention in recent years. However, it is a general rule that any approach can only be as accurate as the underlying models. Thus, varia...
Brian Cline, Kaviraj Chopra, David Blaauw, Andres ...