Sciweavers

387 search results - page 66 / 78
» Reasoning About Approximate Match Query Results
Sort
View
CLEF
2008
Springer
13 years 10 months ago
A Study of Users' Image Seeking Behaviour in FlickLing
This study aims to explore users' image seeking behaviour when searching for a known, non-annotated image in Flickling provided by iCLEF2008 track. The task assigned to users...
Evgenia Vassilakaki, Frances C. Johnson, Richard J...
SIGIR
2000
ACM
14 years 29 days ago
Evaluating evaluation measure stability
: This paper presents a novel way of examining the accuracy of the evaluation measures commonly used in information retrieval experiments. It validates several of the rules-of-thum...
Chris Buckley, Ellen M. Voorhees
BMCBI
2006
120views more  BMCBI 2006»
13 years 8 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
CVPR
1998
IEEE
14 years 10 months ago
The Sample Tree: A Sequential Hypothesis Testing Approach to 3D Object Recognition
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
Michael A. Greenspan
CSL
2009
Springer
14 years 15 days ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe