Sciweavers

2303 search results - page 77 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
DATAMINE
1999
113views more  DATAMINE 1999»
15 years 2 months ago
A Fast Parallel Clustering Algorithm for Large Spatial Databases
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
Xiaowei Xu, Jochen Jäger, Hans-Peter Kriegel
116
Voted
CLUSTER
2005
IEEE
15 years 8 months ago
Efficient and Robust Computation of Resource Clusters in the Internet
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster
PPOPP
2006
ACM
15 years 8 months ago
Predicting bounds on queuing delay for batch-scheduled parallel machines
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
John Brevik, Daniel Nurmi, Richard Wolski
IPPS
2010
IEEE
15 years 10 days ago
Exploring parallelism in short sequence mapping using Burrows-Wheeler Transform
Next-generation high throughput sequencing instruments are capable of generating hundreds of millions of reads in a single run. Mapping those reads to a reference genome is an ext...
Doruk Bozdag, Ayat Hatem, Ümit V. Çata...
PVM
1997
Springer
15 years 6 months ago
Message Handling in Parallel Radiance
Photo-realistic computergraphics is an area of research which tries to develop algorithms and methods to render images of arti cial models or worlds as realistically as possible, b...
Erik Reinhard, Alan Chalmers