Sciweavers

3368 search results - page 419 / 674
» The Complexity of Query Reliability
Sort
View
NDQA
2003
119views Education» more  NDQA 2003»
15 years 8 months ago
Inference Web: Portable and Sharable Explanations for Question Answering
The World Wide Web lacks support for explaining information provenance. When web applications return results, many users do not know what information sources were used, when they ...
Deborah L. McGuinness, Paulo Pinheiro da Silva
BMCBI
2011
15 years 1 months ago
Detection of viral sequence fragments of HIV-1 subfamilies yet unknown
Background: Methods of determining whether or not any particular HIV-1 sequence stems - completely or in part - from some unknown HIV-1 subtype are important for the design of vac...
Thomas Unterthiner, Anne-Kathrin Schultz, Jan Bull...
PAMI
2012
13 years 9 months ago
A Tree-Based Context Model for Object Recognition
—There has been a growing interest in exploiting contextual information in addition to local features to detect and localize multiple object categories in an image. A context mod...
Myung Jin Choi, Antonio Torralba, Alan S. Willsky
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
16 years 2 days ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
CVPR
1997
IEEE
16 years 8 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe