Sciweavers

2745 search results - page 32 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
ICCS
2001
Springer
15 years 7 months ago
On Parallel Pseudo-Random Number Generation
Parallel computing has been touted as the pinnacle of high performance digital computing by many. However, many problems remain intractable using deterministic algorithms. Randomiz...
Chih Jeng Kenneth Tan
ASPDAC
2007
ACM
110views Hardware» more  ASPDAC 2007»
15 years 7 months ago
Fast Placement Optimization of Power Supply Pads
Power grid networks in VLSI circuits are required to provide adequate input supply to ensure reliable performance. In this paper, we propose algorithms to find the placement of pow...
Yu Zhong, Martin D. F. Wong
BMCBI
2010
205views more  BMCBI 2010»
15 years 3 months ago
A fast indexing approach for protein structure comparison
Background: Protein structure comparison is a fundamental task in structural biology. While the number of known protein structures has grown rapidly over the last decade, searchin...
Lei Zhang, James Bailey, Arun Siddharth Konagurthu...
BMCBI
2006
120views more  BMCBI 2006»
15 years 3 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 6 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...