Sciweavers

2260 search results - page 373 / 452
» A new algorithm for clustering search results
Sort
View
JSA
2000
115views more  JSA 2000»
14 years 11 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
BMCBI
2008
158views more  BMCBI 2008»
14 years 12 months ago
Analyzing M-CSF dependent monocyte/macrophage differentiation: Expression modes and meta-modes derived from an independent compo
Background: The analysis of high-throughput gene expression data sets derived from microarray experiments still is a field of extensive investigation. Although new approaches and ...
Dominik Lutter, Peter Ugocsai, Margot Grandl, Evel...
SBACPAD
2003
IEEE
138views Hardware» more  SBACPAD 2003»
15 years 5 months ago
Finite Difference Simulations of the Navier-Stokes Equations Using Parallel Distributed Computing
 This paper discusses the implementation of a numerical algorithm for simulating incompressible fluid flows based on the finite difference method and designed for parallel compu...
João Paulo De Angeli, Andréa M. P. V...
STOC
2004
ACM
145views Algorithms» more  STOC 2004»
16 years 4 days ago
Using mixture models for collaborative filtering
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
Jon M. Kleinberg, Mark Sandler
ATAL
2011
Springer
13 years 12 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe