Sciweavers

312 search results - page 23 / 63
» An experimental study on algorithms for drawing binary trees
Sort
View
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
ICDM
2009
IEEE
124views Data Mining» more  ICDM 2009»
13 years 5 months ago
A Practical Differentially Private Random Decision Tree Classifier
In this paper, we study the problem of constructing private classifiers using decision trees, within the framework of differential privacy. We first construct privacy-preserving ID...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...
INFOCOM
2008
IEEE
14 years 1 months ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
14 years 1 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
CORR
2012
Springer
281views Education» more  CORR 2012»
12 years 3 months ago
Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
Lu Zheng, Ole J. Mengshoel, Jike Chong