Sciweavers

1279 search results - page 57 / 256
» Fast Implementations of Automata Computations
Sort
View
EUROGRAPHICS
2010
Eurographics
15 years 9 months ago
Fast High-Dimensional Filtering Using the Permutohedral Lattice
Many useful algorithms for processing images and geometry fall under the general framework of high-dimensional Gaussian filtering. This family of algorithms includes bilateral ...
Andrew Adams, Jongmin Baek, Myers Abraham Davis
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 5 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
VLSISP
2010
205views more  VLSISP 2010»
14 years 10 months ago
Adaptable, Fast, Area-Efficient Architecture for Logarithm Approximation with Arbitrary Accuracy on FPGA
— This paper presents ALA (Adaptable Logarithm Approximation), a novel hardware architecture for the approximation of the base-2 logarithm of integers at an arbitrary accuracy, s...
Dimitris G. Bariamis, Dimitris Maroulis, Dimitrios...
CORR
2010
Springer
208views Education» more  CORR 2010»
14 years 12 months ago
MapReduce for Integer Factorization
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
Javier Tordable
INFORMATICALT
2006
134views more  INFORMATICALT 2006»
14 years 11 months ago
Fast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...
Chia-Long Wu, Der-Chyuan Lou, Jui-Chang Lai, Te-Je...