Sciweavers

502 search results - page 25 / 101
» Verifying Balanced Trees
Sort
View
PAKDD
2007
ACM
140views Data Mining» more  PAKDD 2007»
14 years 5 months ago
A Hybrid Multi-group Privacy-Preserving Approach for Building Decision Trees
In this paper, we study the privacy-preserving decision tree building problem on vertically partitioned data. We made two contributions. First, we propose a novel hybrid approach, ...
Zhouxuan Teng, Wenliang Du
ICC
2008
IEEE
135views Communications» more  ICC 2008»
14 years 5 months ago
Testbed Experimentation of a Meshed Tree Routing with Local Link State for Wireless PAN Mesh
— This paper focus on the testbed experimentation of a meshed tree routing algorithm with local link state for Wireless Personal Area networks (WPANs) based on current IEEE 802.1...
Rui Zhang, Tae Rim Park, Myung J. Lee, Hakyung Jun...
APN
2009
Springer
14 years 5 months ago
Compositional Service Trees
In the world of Service Oriented Architectures, one deals with networks of cooperating components. A component offers services; to deliver a service it possibly needs services of ...
Wil M. P. van der Aalst, Kees M. van Hee, Peter Ma...
JCB
2002
108views more  JCB 2002»
13 years 10 months ago
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
Richard Desper, Olivier Gascuel
WETICE
2009
IEEE
14 years 5 months ago
Search Optimizations in Structured Peer-to-Peer Systems
Abstract—DHT systems are structured overlay networks capable of using P2P resources as a scalable platform for very large data storage applications. However, their efficiency ex...
Nuno Lopes, Carlos Baquero