Sciweavers

1089 search results - page 47 / 218
» Randomness and Reducibility
Sort
View
PAKDD
2007
ACM
140views Data Mining» more  PAKDD 2007»
14 years 3 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
FSTTCS
1992
Springer
14 years 1 months ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami
FOCS
2006
IEEE
14 years 3 months ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...
ATS
2005
IEEE
191views Hardware» more  ATS 2005»
14 years 2 months ago
Low Transition LFSR for BIST-Based Applications
Abstract—This paper presents a low transition test pattern generator, called LT-LFSR, to reduce average and peak power of a circuit during test by reducing the transitions within...
Mohammad Tehranipoor, Mehrdad Nourani, Nisar Ahmed
PR
2006
102views more  PR 2006»
13 years 9 months ago
Prototype selection for dissimilarity-based classifiers
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
Elzbieta Pekalska, Robert P. W. Duin, Pavel Pacl&i...