Sciweavers

450 search results - page 86 / 90
» Algorithmic uses of the Feferman-Vaught Theorem
Sort
View
JCDL
2006
ACM
161views Education» more  JCDL 2006»
14 years 1 months ago
Learning metadata from the evidence in an on-line citation matching scheme
Citation matching, or the automatic grouping of bibliographic references that refer to the same document, is a data management problem faced by automatic digital libraries for sci...
Isaac G. Councill, Huajing Li, Ziming Zhuang, Sand...
STACS
1993
Springer
13 years 11 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
SOFSEM
2009
Springer
14 years 4 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach
MIR
2010
ACM
325views Multimedia» more  MIR 2010»
13 years 9 months ago
A classification-driven similarity matching framework for retrieval of biomedical images
This paper presents a classification-driven biomedical image retrieval system to bride the semantic gap by transforming image features to their global categories at different gran...
Md. Mahmudur Rahman, Sameer Antani, George R. Thom...
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 7 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett