Sciweavers

675 search results - page 26 / 135
» Biased Range Trees
Sort
View
105
Voted
CSDA
2008
128views more  CSDA 2008»
14 years 11 months ago
Classification tree analysis using TARGET
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
J. Brian Gray, Guangzhe Fan
TON
2008
79views more  TON 2008»
14 years 10 months ago
A stochastic foundation of available bandwidth estimation: multi-hop analysis
This paper analyzes the asymptotic behavior of packet-train probing over a multi-hop network path carrying arbitrarily routed bursty cross-traffic flows. We examine the statistical...
Xiliang Liu, Kaliappa Nadar Ravindran, Dmitri Logu...
ESORICS
2009
Springer
15 years 11 months ago
Tracking Information Flow in Dynamic Tree Structures
Abstract. This paper explores the problem of tracking information flow in dynamic tree structures. Motivated by the problem of manipulating the Document Object Model (DOM) trees by...
Alejandro Russo, Andrei Sabelfeld, Andrey Chudnov
DAWAK
2006
Springer
15 years 2 months ago
Mixed Decision Trees: An Evolutionary Approach
In the paper, a new evolutionary algorithm (EA) for mixed tree learning is proposed. In non-terminal nodes of a mixed decision tree different types of tests can be placed, ranging ...
Marek Kretowski, Marek Grzes
91
Voted
CORR
2007
Springer
134views Education» more  CORR 2007»
14 years 11 months ago
A Partition-Based Relaxation For Steiner Trees
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
Jochen Könemann, David Pritchard, Kunlun Tan