Sciweavers

385 search results - page 25 / 77
» A Fast Algorithm for Matrix Balancing
Sort
View
CORR
2010
Springer
61views Education» more  CORR 2010»
13 years 10 months ago
A weakly stable algorithm for general Toeplitz systems
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
Adam W. Bojanczyk, Richard P. Brent, Frank R. de H...
INFOCOM
2003
IEEE
14 years 3 months ago
Dynamic Load Balancing Through Coordinated Scheduling in Packet Data Systems
— Third generation code-division multiple access (CDMA) systems propose to provide packet data service through a high speed shared channel with intelligent and fast scheduling at...
Suman Das, Harish Viswanathan, Gee Rittenhouse
AINA
2004
IEEE
14 years 1 months ago
Balancing Workload based on Content Types for Scalable Web Server Clusters
With the rapid growth of information stored in worldwide web servers, searching and capturing data on Internet become a common behavior for us. In order to increase the availabili...
Tzung-Shi Chen, Kuo-Lian Chen
INFOCOM
2007
IEEE
14 years 4 months ago
Multiple-Choice Random Network for Server Load Balancing
Abstract—In many networking applications such as file sharing, structured peer-to-peer networks are increasingly used in dynamic situations with fluctuating load, which require...
Ye Xia, Alin Dobra, Seung Chul Han
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
14 years 3 months ago
Finding Biclusters by Random Projections
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Ya...