Sciweavers

680 search results - page 11 / 136
» A randomized embedding algorithm for trees
Sort
View
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...
ECCC
2010
108views more  ECCC 2010»
13 years 4 months ago
Improved bounds for the randomized decision tree complexity of recursive majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Frédéric Magniez, Ashwin Nayak, Mikl...
CPC
2007
97views more  CPC 2007»
13 years 7 months ago
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
Jan Remy, Alexander Souza, Angelika Steger
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
13 years 7 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner
ATS
2000
IEEE
98views Hardware» more  ATS 2000»
13 years 12 months ago
Embedded core testing using genetic algorithms
Testing of embedded cores is very difficult in SOC (system-on-a-chip), since the core user may not know the gate level implementation of the core, and the controllability and obse...
Ruofan Xu, Michael S. Hsiao