Sciweavers

4553 search results - page 846 / 911
» Distributed Ranked Search
Sort
View
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
13 years 11 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
SC
1995
ACM
13 years 11 months ago
Parallelizing the Phylogeny Problem
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
Jeff A. Jones, Katherine A. Yelick
ICS
2010
Tsinghua U.
13 years 10 months ago
Clustering performance data efficiently at massive scales
Existing supercomputers have hundreds of thousands of processor cores, and future systems may have hundreds of millions. Developers need detailed performance measurements to tune ...
Todd Gamblin, Bronis R. de Supinski, Martin Schulz...
CIKM
2008
Springer
13 years 10 months ago
SoRec: social recommendation using probabilistic matrix factorization
Data sparsity, scalability and prediction quality have been recognized as the three most crucial challenges that every collaborative filtering algorithm or recommender system conf...
Hao Ma, Haixuan Yang, Michael R. Lyu, Irwin King
CIKM
2008
Springer
13 years 10 months ago
Pairwise statistical significance of local sequence alignment using multiple parameter sets
Background: Accurate estimation of statistical significance of a pairwise alignment is an important problem in sequence comparison. Recently, a comparative study of pairwise stati...
Ankit Agrawal, Xiaoqiu Huang