Sciweavers

486 search results - page 12 / 98
» Parallel Algorithms for Relational Coarsest Partition Proble...
Sort
View
TCS
2008
13 years 7 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
EPEW
2005
Springer
14 years 1 months ago
Hypergraph Partitioning for Faster Parallel PageRank Computation
The PageRank algorithm is used by search engines such as Google to order web pages. It uses an iterative numerical method to compute the maximal eigenvector of a transition matrix ...
Jeremy T. Bradley, Douglas V. de Jager, William J....
ESA
1999
Springer
148views Algorithms» more  ESA 1999»
13 years 12 months ago
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
Leah Epstein, Jiri Sgall
OL
2010
140views more  OL 2010»
13 years 2 months ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...
IPPS
2008
IEEE
14 years 2 months ago
Parallelized preprocessing algorithms for high-density oligonucleotide arrays
Studies of gene expression using high-density oligonucleotide microarrays have become standard in a variety of biological contexts. The data recorded using the microarray techniqu...
Markus Schmidberger, Ulrich Mansmann