Sciweavers

356 search results - page 26 / 72
» Robust and efficient algorithms for rank join evaluation
Sort
View
WWW
2010
ACM
15 years 4 months ago
Generalized distances between rankings
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
Ravi Kumar, Sergei Vassilvitskii
IPPS
2010
IEEE
14 years 7 months ago
Parallel external memory graph algorithms
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
Lars Arge, Michael T. Goodrich, Nodari Sitchinava
SIGMOD
2008
ACM
206views Database» more  SIGMOD 2008»
15 years 9 months ago
Ad-hoc aggregations of ranked lists in the presence of hierarchies
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
Nilesh Bansal, Sudipto Guha, Nick Koudas
ECCV
1996
Springer
15 years 11 months ago
Accuracy vs. Efficiency Trade-offs in Optical Flow Algorithms
There have been two thrusts in the development of optical flow algorithms. One has emphasized higher accuracy; the other faster implementation. These two thrusts, however, have be...
Hongche Liu, Tsai-Hong Hong, Martin Herman, Rama C...
SAC
2010
ACM
14 years 4 months ago
Convex onion peeling genetic algorithm: an efficient solution to map labeling of point-feature
Map labeling of point-feature is the problem of placing text labels to corresponding point features on a map in a way that minimizes overlaps while satisfying basic rules for the ...
Wan D. Bae, Shayma Alkobaisi, Petr Vojtechovsk&yac...