Sciweavers

94 search results - page 15 / 19
» The Random Subspace Method for Constructing Decision Forests
Sort
View
DMIN
2006
134views Data Mining» more  DMIN 2006»
13 years 9 months ago
Hyper-Rectangular and k-Nearest-Neighbor Models in Stochastic Discrimination
The stochastic discrimination (SD) theory considers learning as building models of uniform coverage over data distributions. Despite successful trials of the derived SD method in s...
Iryna Skrypnyk, Tin Kam Ho
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
12 years 10 months ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
GLOBECOM
2009
IEEE
14 years 2 months ago
How Much Training Is Needed for Iterative Multiuser Detection and Decoding?
Abstract—This paper studies large randomly spread directsequence code-division multiple-access system operating over a block fading multipath channel. Channel knowledge is obtain...
Mikko Vehkaperä, Keigo Takeuchi, Ralf R. M&uu...
PR
2006
102views more  PR 2006»
13 years 7 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...
PAMI
2000
113views more  PAMI 2000»
13 years 7 months ago
Hierarchical Discriminant Regression
This paper presents a new technique which incrementally builds a hierarchical discriminant regression (IHDR) tree for generation of motion based robot reactions. The robot learned...
Wey-Shiuan Hwang, Juyang Weng