8728 search results - page 374 / 1746 » On Reduct Construction Algorithms |
194
click to vote
NIPS
2004
15 years 8 months ago
2004
This paper investigates the effect of Kernel Principal Component Analysis (KPCA) within the classification framework, essentially the regularization properties of this dimensional...
162
Voted
IPL
2006
15 years 6 months ago
2006
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
187
click to vote
ISITA
2010
15 years 4 months ago
2010
In this paper we propose a modication of the Hopeld neural networks for vector precoding, based on Lenstra, Lenstra, and Lov`asz lattice basis reduction. This precoding algorithm c...
166
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
In patch-based object recognition, using a compact visual codebook can boost computational efficiency and reduce memory cost. Nevertheless, compared with a large-sized codebook, it...
201
click to vote
DCC
2003
IEEE
16 years 6 months ago
2003
IEEE
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...