Sciweavers

44 search results - page 6 / 9
» On Optimal Node Splitting for R-trees
Sort
View
AAAI
2004
14 years 11 months ago
On the Optimality of Probability Estimation by Random Decision Trees
Random decision tree is an ensemble of decision trees. The feature at any node of a tree in the ensemble is chosen randomly from remaining features. A chosen discrete feature on a...
Wei Fan
ISW
2004
Springer
15 years 3 months ago
Re-thinking Security in IP Based Micro-Mobility
Security problems in micro-mobility are mostly related to trust establishment between mobile nodes and middle-boxes, i.e. mobile anchor points. In this paper, we present a secure m...
Jukka Ylitalo, Jan Melén, Pekka Nikander, V...
NETWORKING
2010
14 years 11 months ago
Cost Bounds of Multicast Light-Trees in WDM Networks
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
Fen Zhou, Miklós Molnár, Bernard Cou...
ICML
2004
IEEE
15 years 11 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
DAWAK
2008
Springer
14 years 12 months ago
Efficient Data Distribution for DWS
The DWS (Data Warehouse Striping) technique is a data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables are distribute...
Raquel Almeida, Jorge Vieira, Marco Vieira, Henriq...