Sciweavers

822 search results - page 51 / 165
» Descendants in Increasing Trees
Sort
View
ICANN
2007
Springer
14 years 1 months ago
An Efficient Search Strategy for Feature Selection Using Chow-Liu Trees
Within the taxonomy of feature extraction methods, recently the Wrapper approaches lost some popularity due to the associated computational burden, compared to Embedded or Filter m...
Erik Schaffernicht, Volker Stephan, Horst-Michael ...
DAC
1995
ACM
14 years 1 months ago
The Elmore Delay as a Bound for RC Trees with Generalized Input Signals
The Elmore delay is an extremely popular delay metric, particularly for RC tree analysis. The widespread usage of this metric is mainly attributable to it being the most accurate ...
Rohini Gupta, Byron Krauter, Bogdan Tutuianu, John...
CG
2010
Springer
13 years 8 months ago
Scalability and Parallelization of Monte-Carlo Tree Search
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...
Amine Bourki, Guillaume Chaslot, Matthieu Coulm, V...
ICASSP
2009
IEEE
13 years 7 months ago
Tree configuration games for distributed stream mining systems
We consider the problem of configuring classifier trees in distributed stream mining system. The configuration involves selecting appropriate false-alarm detection tradeoffs for e...
Hyunggon Park, Deepak S. Turaga, Olivier Verscheur...
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 5 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox