Sciweavers

455 search results - page 16 / 91
» On Trees and Noncrossing Partitions
Sort
View
TKDD
2008
52views more  TKDD 2008»
13 years 7 months ago
Privacy-preserving decision trees over vertically partitioned data
Jaideep Vaidya, Chris Clifton, Murat Kantarcioglu,...
DAM
1998
66views more  DAM 1998»
13 years 7 months ago
Approximation Algorithms for Minimum Tree Partition
Nili Guttmann-Beck, Refael Hassin
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 1 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
DAM
2007
74views more  DAM 2007»
13 years 7 months ago
On the uniform edge-partition of a tree
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao ...
PAAPP
2006
85views more  PAAPP 2006»
13 years 7 months ago
A new metric splitting criterion for decision trees
Abstract: We examine a new approach to building decision tree by introducing a geometric splitting criterion, based on the properties of a family of metrics on the space of partiti...
Dan A. Simovici, Szymon Jaroszewicz