Sciweavers

5659 search results - page 1024 / 1132
» Comparing Clusterings in Space
Sort
View
STORAGESS
2005
ACM
15 years 10 months ago
Secure capabilities for a petabyte-scale object-based distributed file system
Recently, the Network-Attached Secure Disk (NASD) model has become a more widely used technique for constructing large-scale storage systems. However, the security system proposed...
Christopher Olson, Ethan L. Miller
CIKM
2005
Springer
15 years 10 months ago
Semantic similarity over the gene ontology: family correlation and selecting disjunctive ancestors
Many bioinformatics applications would benefit from comparing proteins based on their biological role rather than their sequence. In most biological databases, proteins are alrea...
Francisco M. Couto, Mário J. Silva, Pedro C...
DILS
2005
Springer
15 years 10 months ago
PLATCOM: Current Status and Plan for the Next Stages
We have been developing a system for comparing multiple genomes, PLATCOM, where users can choose genomes of their choice freely and perform analysis of the selected genomes with a...
Kwangmin Choi, Jeong-Hyeon Choi, Amit Saple, Zhipi...
EPEW
2005
Springer
15 years 10 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
2005
Springer
123views Algorithms» more  ESA 2005»
15 years 10 months ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
« Prev « First page 1024 / 1132 Last » Next »