Sciweavers

4095 search results - page 218 / 819
» How to test a tree
Sort
View
87
Voted
KDD
2003
ACM
113views Data Mining» more  KDD 2003»
16 years 28 days ago
Using randomized response techniques for privacy-preserving data mining
Privacy is an important issue in data mining and knowledge discovery. In this paper, we propose to use the randomized response techniques to conduct the data mining computation. S...
Wenliang Du, Zhijun Zhan
91
Voted
IPPS
2005
IEEE
15 years 6 months ago
A Distributed Procedure for Bandwidth-Centric Scheduling of Independent-Task Applications
The problem of scheduling independent tasks on heterogeneous trees is considered. The nodes of the tree may have different processing times, and links different communication time...
Cyril Banino
CPAIOR
2005
Springer
15 years 6 months ago
Nondeterministic Control for Hybrid Search
Hybrid algorithms combining local and systematic search often use nondeterminism in fundamentally different ways. They may differ in the strategy to explore the search tree and/o...
Pascal Van Hentenryck, Laurent Michel
FLOPS
2004
Springer
15 years 6 months ago
DDT: a Declarative Debugging Tool for Functional-Logic Languages
We present a graphical tool for the declarative debugging of wrong answers in functional-logic languages. The tool, integrated in the system T OY, can be used to navigate a computa...
Rafael Caballero, Mario Rodríguez-Artalejo
105
Voted
GD
2004
Springer
15 years 6 months ago
Visualisation of Large and Complex Networks Using PolyPlane
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...
Seok-Hee Hong, Tom Murtagh