Sciweavers

2745 search results - page 393 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
HPDC
2010
IEEE
15 years 6 months ago
A data transfer framework for large-scale science experiments
Modern scientific experiments can generate hundreds of gigabytes to terabytes or even petabytes of data that may furthermore be maintained in large numbers of relatively small fil...
Wantao Liu, Brian Tieman, Rajkumar Kettimuthu, Ian...
138
Voted
TON
2010
109views more  TON 2010»
15 years 3 months ago
Rendered path: range-free localization in anisotropic sensor networks with holes
Sensor positioning is a crucial part of many location-dependent applications that utilize wireless sensor networks (WSNs). Current localization approaches can be divided into two ...
Mo Li, Yunhao Liu
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 11 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
FCCM
2005
IEEE
132views VLSI» more  FCCM 2005»
15 years 10 months ago
Hardware Factorization Based on Elliptic Curve Method
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is ...
Martin Simka, Jan Pelzl, Thorsten Kleinjung, Jens ...
137
Voted
BMCBI
2008
164views more  BMCBI 2008»
15 years 5 months ago
Word correlation matrices for protein sequence analysis and remote homology detection
Background: Classification of protein sequences is a central problem in computational biology. Currently, among computational methods discriminative kernel-based approaches provid...
Thomas Lingner, Peter Meinicke