Sciweavers

634 search results - page 17 / 127
» Fast Evaluation Techniques for Complex Similarity Queries
Sort
View
CVPR
2010
IEEE
14 years 4 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff
ICMCS
2005
IEEE
132views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Approximating the selectivity of multimedia range queries
This paper introduces a new approach of approximating the selectivity of multimedia range queries. Estimating the selectivity of a range query is a pre-requisite to optimize a mul...
Mario Döller, Harald Kosch
ESA
2004
Springer
137views Algorithms» more  ESA 2004»
14 years 1 months ago
Fast 3-Coloring Triangle-Free Planar Graphs
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
Lukasz Kowalik
ICMCS
2006
IEEE
139views Multimedia» more  ICMCS 2006»
14 years 2 months ago
A Measure for Evaluating Retrieval Techniques based on Partially Ordered Ground Truth Lists
For the RISM A/II collection of musical incipits (short extracts of scores, taken from the beginning), we have established a ground truth based on the opinions of human experts. I...
Rainer Typke, Remco C. Veltkamp, Frans Wiering
IADIS
2004
13 years 9 months ago
'surfing for knowledge' finding semantically similar Web clusters
In this paper we present our technique for finding semantically similar clusters within web documents obtained from a set of queries retrieved from the Google search engine. This ...
David Cleary, Diarmuid O'Donoghue