6568 search results - page 291 / 1314 » Reducing the Complexity of Reductions |
186
Voted
SBCCI
2009
ACM
15 years 11 months ago
2009
ACM
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications (MCM), has been a central operation and performance bottleneck in many applicat...
183
click to vote
ICIP
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in highdimensional Euclidean spaces. We show that geodesic paths ...
157
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We evaluate the performance of FPT algorithms for the directed feedback vertex set problem (DFVS). We propose several new data reduction rules for DFVS. which can signiļ¬...
178
click to vote
CRYPTO
2004
Springer
16 years 5 days ago
2004
Springer
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to ācompressā Rabin ciphertexts and signatures (among...
175
click to vote
CAEPIA
2003
Springer
16 years 7 hour ago
2003
Springer
Abstract. In this paper, some new approaches to training set size reduction are presented. These schemes basically consist of deļ¬ning a small number of prototypes that represent ...