Sciweavers

1024 search results - page 189 / 205
» High-Level Execution Time Analysis
Sort
View
IOR
2002
135views more  IOR 2002»
13 years 10 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
14 years 11 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
PODC
2009
ACM
14 years 5 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
14 years 5 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland
IPPS
2007
IEEE
14 years 5 months ago
A Performance Prediction Framework for Grid-Based Data Mining Applications
For a grid middleware to perform resource allocation, prediction models are needed, which can determine how long an application will take for completion on a particular platform o...
Leonid Glimcher, Gagan Agrawal