Sciweavers

6740 search results - page 1097 / 1348
» Querying Databases with Taxonomies
Sort
View
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 10 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
ACL
1989
15 years 7 months ago
The Lexical Semantics of Comparative Expressions in a Multi-Level Semantic Processor
Comparative expressions (CEs) such as "bigger than" and "more oranges than" are highly ambiguous, and their meaning is context dependent. Thus, they pose probl...
Duane E. Olawsky
BMCBI
2008
165views more  BMCBI 2008»
15 years 6 months ago
SWS: accessing SRS sites contents through Web Services
Background: Web Services and Workflow Management Systems can support creation and deployment of network systems, able to automate data analysis and retrieval processes in biomedic...
Paolo Romano 0001, Domenico Marra
CIKM
2009
Springer
16 years 1 months ago
Enabling multi-level relevance feedback on pubmed by integrating rank learning into DBMS
Background: Finding relevant articles from PubMed is challenging because it is hard to express the user’s specific intention in the given query interface, and a keyword query ty...
Hwanjo Yu, Taehoon Kim, Jinoh Oh, Ilhwan Ko, Sungc...
213
Voted
CVPR
2004
IEEE
16 years 8 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
« Prev « First page 1097 / 1348 Last » Next »