Sciweavers

2745 search results - page 5 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
14 years 7 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
13 years 8 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel
QUESTA
2011
13 years 1 months ago
Large number of queues in tandem: Scaling properties under back-pressure algorithm
Abstract We consider a system with N unit-service-rate queues in tandem, with exogenous arrivals of rate λ at queue 1, under a back-pressure (MaxWeight) algorithm: service at queu...
Alexander L. Stolyar
AINA
2003
IEEE
14 years 20 days ago
Fast Algorithms for Common-Multiplicand Multiplication and Exponentiation by Performing Complements
The multiplications of common multiplicands and exponentiations of large integers with a large modulus are the primary computation operations in several well-known public key cryp...
Chin-Chen Chang, Ying-Tse Kuo, Chu-Hsing Lin
DAC
1996
ACM
13 years 11 months ago
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
Hiroyuki Higuchi, Yusuke Matsunaga