Sciweavers

849 search results - page 38 / 170
» Completely Non-malleable Schemes
Sort
View
JCDL
2006
ACM
161views Education» more  JCDL 2006»
15 years 3 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...
IJCAI
1997
14 years 11 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
BMCBI
2006
74views more  BMCBI 2006»
14 years 9 months ago
An unsupervised classification scheme for improving predictions of prokaryotic TIS
Background: Although it is not difficult for state-of-the-art gene finders to identify coding regions in prokaryotic genomes, exact prediction of the corresponding translation ini...
Maike Tech, Peter Meinicke
SIAMCO
2000
123views more  SIAMCO 2000»
14 years 9 months ago
Adaptive LQG Control of Input-Output Systems---A Cost-biased Approach
In this paper, we consider linear systems in input-output form and introduce a new adaptive linear quadratic Gaussian (LQG) control scheme which is shown to be self-optimizing. The...
Maria Prandini, Marco C. Campi
SIGMETRICS
2002
ACM
118views Hardware» more  SIGMETRICS 2002»
14 years 9 months ago
Robust traffic engineering: game theoretic perspective
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
Vladimir Marbukh