Sciweavers

3136 search results - page 101 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
Classification and evaluation of cost aggregation methods for stereo correspondence
In the last decades several cost aggregation methods aimed at improving the robustness of stereo correspondence within local and global algorithms have been proposed. Given the re...
Federico Tombari, Stefano Mattoccia, Luigi di Stef...
ICML
2009
IEEE
16 years 7 months ago
Interactively optimizing information retrieval systems as a dueling bandits problem
We present an on-line learning framework tailored towards real-time learning from observed user behavior in search engines and other information retrieval systems. In particular, ...
Yisong Yue, Thorsten Joachims
COCOON
2005
Springer
15 years 11 months ago
Randomized Quicksort and the Entropy of the Random Source
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
Beatrice List, Markus Maucher, Uwe Schöning, ...
ACIVS
2005
Springer
15 years 12 months ago
Cleaning and Enhancing Historical Document Images
In this paper we present a recursive algorithm for the cleaning and the enhancing of historical documents. Most of the algorithms, used to clean and enhance documents or transform ...
Ergina Kavallieratou, Hera Antonopoulou
JCB
2008
170views more  JCB 2008»
15 years 6 months ago
Efficiently Identifying Max-Gap Clusters in Pairwise Genome Comparison
The spatial clustering of genes across different genomes has been used to study important problems in comparative genomics, from identification of operons to detection of homologo...
Xu Ling, Xin He, Dong Xin, Jiawei Han