Sciweavers

728 search results - page 131 / 146
» Online Parallel Boosting
Sort
View
FOCS
2007
IEEE
13 years 11 months ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar
VLDB
1995
ACM
179views Database» more  VLDB 1995»
13 years 11 months ago
The ClustRa Telecom Database: High Availability, High Throughput, and Real-Time Response
New telecommunication services and mobility networks have introduced databases in telecommunication networks. Compared with traditional use of databases, telecom databases must fu...
Svein-Olaf Hvasshovd, Øystein Torbjø...
ASPLOS
1991
ACM
13 years 11 months ago
NUMA Policies and Their Relation to Memory Architecture
Multiprocessor memory reference traces provide a wealth of information on the behavior of parallel programs. We have used this information to explore the relationship between kern...
William J. Bolosky, Michael L. Scott, Robert P. Fi...
SDM
2010
SIAM
200views Data Mining» more  SDM 2010»
13 years 9 months ago
Residual Bayesian Co-clustering for Matrix Approximation
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
Hanhuai Shan, Arindam Banerjee
SODA
2008
ACM
80views Algorithms» more  SODA 2008»
13 years 9 months ago
Provably good multicore cache performance for divide-and-conquer algorithms
This paper presents a multicore-cache model that reflects the reality that multicore processors have both per-processor private (L1) caches and a large shared (L2) cache on chip. ...
Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B....