20 search results - page 3 / 4 » Depth Estimation for Ranking Query Optimization |
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
ECIR
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. Content-based image retrieval (CBIR) with global features is notoriously noisy, especially for image queries with low percentages of relevant images in a collection. More...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
HAPTICS
2002
IEEE
13 years 10 months ago
2002
IEEE
: We present a six-degree-of-freedom haptic rendering algorithm using localized contact computations. It takes advantage of high motion coherence due to fast force update and spati...