Sciweavers

1503 search results - page 181 / 301
» Self-optimizing distributed trees
Sort
View
CORR
2008
Springer
159views Education» more  CORR 2008»
15 years 3 months ago
Privacy Preserving ID3 over Horizontally, Vertically and Grid Partitioned Data
We consider privacy preserving decision tree induction via ID3 in the case where the training data is horizontally or vertically distributed. Furthermore, we consider the same pro...
Bart Kuijpers, Vanessa Lemmens, Bart Moelans, Karl...
CLUSTER
1998
IEEE
15 years 3 months ago
Forwarding Group Multicast Protocol (FGMP) for multihop, mobile wireless networks
In this paper we propose a new multicast protocol for multihop mobile wireless networks. Instead of forming multicast trees, a group of nodes in charge of forwarding multicast pac...
Ching-Chuan Chiang, Mario Gerla, Lixia Zhang
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
15 years 1 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
SIGCOMM
2010
ACM
15 years 4 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...
CIE
2009
Springer
15 years 10 months ago
Members of Random Closed Sets
Abstract. The members of Martin-L¨of random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-L¨of random Galton-Watson...
David Diamondstone, Bjørn Kjos-Hanssen