3098 search results - page 331 / 620 » On distributed smooth scheduling |
163
click to vote
SIGIR
2010
ACM
15 years 10 months ago
2010
ACM
In this paper, we propose a new application of Bayesian language model based on Pitman-Yor process for information retrieval. This model is a generalization of the Dirichlet distr...
197
click to vote
WSCG
2004
15 years 8 months ago
2004
In this paper we describe a new method for improving the representation of textures in blends of multiple images based on a Markov Random Field (MRF) algorithm. We show that direc...
191
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
Real-time tessellation methods offer the ability to upsample 3D surface meshes on the fly during rendering. This upsampling relies on 3 major steps. First, it requires a tessellat...
164
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
170
click to vote
SC
2009
ACM
16 years 1 months ago
2009
ACM
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...