Sciweavers

3891 search results - page 200 / 779
» Query Models
Sort
View
186
Voted
JCSS
2008
120views more  JCSS 2008»
15 years 6 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
PAMI
2007
92views more  PAMI 2007»
15 years 5 months ago
Modeling and Predicting Face Recognition System Performance Based on Analysis of Similarity Scores
—This paper presents methods of modeling and predicting face recognition (FR) system performance based on analysis of similarity scores. We define the performance of an FR system...
Peng Wang, Qiang Ji, James L. Wayman
WWW
2010
ACM
16 years 1 months ago
Diversifying web search results
Result diversity is a topic of great importance as more facets of queries are discovered and users expect to find their desired facets in the first page of the results. However,...
Davood Rafiei, Krishna Bharat, Anand Shukla
AAAI
2007
15 years 8 months ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz
SIGOPS
2010
84views more  SIGOPS 2010»
15 years 4 months ago
LazyBase: freshness vs. performance in information management
Information management applications exhibit a wide range of query performance and result freshness goals. Some applications, such as web search, require interactive performance, b...
Kimberly Keeton, Charles B. Morrey III, Craig A. N...