Sciweavers

1449 search results - page 237 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
CF
2009
ACM
16 years 15 days ago
Quantitative analysis of sequence alignment applications on multiprocessor architectures
The exponential growth of databases that contains biological information (such as protein and DNA data) demands great efforts to improve the performance of computational platforms...
Friman Sánchez, Alex Ramírez, Mateo ...
CVPR
2008
IEEE
16 years 14 days ago
Scene understanding with discriminative structured prediction
Spatial priors play crucial roles in many high-level vision tasks, e.g. scene understanding. Usually, learning spatial priors relies on training a structured output model. In this...
Jinhui Yuan, Jianmin Li, Bo Zhang
FOCS
2008
IEEE
16 years 14 days ago
Clock Synchronization with Bounded Global and Local Skew
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer
ISCAS
2008
IEEE
191views Hardware» more  ISCAS 2008»
16 years 12 days ago
A novel approach for K-best MIMO detection and its VLSI implementation
— Since the complexity of MIMO detection algorithms is exponential, the K–best algorithm is often chosen for efficient VLSI implementation. This detection problem is often view...
Sudip Mondal, Khaled N. Salama, Wersame H. Ali
ARITH
2007
IEEE
16 years 10 days ago
Modular Multiplication using Redundant Digit Division
Most implementations of the modular exponentiation, ME mod N, computation in cryptographic algorithms employ Montgomery multiplication, ABR−1 mod N, instead of modular multiplic...
Ping Tak Peter Tang