Sciweavers

5962 search results - page 160 / 1193
» Efficient Clustering for Orders
Sort
View
IPPS
2005
IEEE
16 years 4 days ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
NIPS
2004
15 years 8 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
CSB
2004
IEEE
173views Bioinformatics» more  CSB 2004»
15 years 10 months ago
Gene Ontology Friendly Biclustering of Expression Profiles
The soundness of clustering in the analysis of gene expression profiles and gene function prediction is based on the hypothesis that genes with similar expression profiles may imp...
Jinze Liu, Wei Wang 0010, Jiong Yang
COMPGEOM
2001
ACM
15 years 10 months ago
Discrete mobile centers
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
FPL
2008
Springer
141views Hardware» more  FPL 2008»
15 years 8 months ago
An analytical model describing the relationships between logic architecture and FPGA density
This paper describes an analytical model, based principally on Rent's Rule, that relates logic architectural parameters to the area efficiency of an FPGA. In particular, the ...
Andrew Lam, Steven J. E. Wilton, Philip Heng Wai L...