Sciweavers

2018 search results - page 279 / 404
» Magnitude-preserving ranking algorithms
Sort
View
DCG
2002
66views more  DCG 2002»
15 years 6 months ago
Generation of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretica...
Lukas Finschi, Komei Fukuda
PAMI
2007
169views more  PAMI 2007»
15 years 5 months ago
Estimating Optimal Parameters for MRF Stereo from a Single Image Pair
—This paper presents a novel approach for estimating the parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterio...
Li Zhang, Steven M. Seitz
PVLDB
2008
136views more  PVLDB 2008»
15 years 5 months ago
Keyword query cleaning
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
Ken Q. Pu, Xiaohui Yu
188
Voted
PVLDB
2010
225views more  PVLDB 2010»
15 years 27 days ago
Efficient Processing of Top-k Spatial Preference Queries
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
163
Voted
CIKM
2011
Springer
14 years 6 months ago
Factorization-based lossless compression of inverted indices
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
George Beskales, Marcus Fontoura, Maxim Gurevich, ...