Sciweavers

892 search results - page 82 / 179
» ets 2007
Sort
View
122
Voted
AMC
2005
256views more  AMC 2005»
15 years 1 months ago
Improved DSA variant for batch verification
Batch verification is a method to verify multiple signatures at once. There are two issues associated with batch verification. One is the security problem and the other is the com...
Chu-Hsing Lin, Ruei-Hau Hsu, Lein Harn
102
Voted
ACS
2004
15 years 1 months ago
Components of the Fundamental Category
Inthis article westudy the fundamental category (Goubault and Raussen, 2002 Goubault, 2002) of a partially ordered topological space (Nachbin, 1965 Johnstone, 1982), as arising in ...
Lisbeth Fajstrup, Martin Raußen, Eric Goubau...
110
Voted
AICOM
2004
92views more  AICOM 2004»
15 years 1 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu
ICML
2008
IEEE
16 years 1 months ago
The projectron: a bounded kernel-based Perceptron
We present a discriminative online algorithm with a bounded memory growth, which is based on the kernel-based Perceptron. Generally, the required memory of the kernelbased Percept...
Francesco Orabona, Joseph Keshet, Barbara Caputo
101
Voted
ACL
2008
15 years 2 months ago
Using Adaptor Grammars to Identify Synergies in the Unsupervised Acquisition of Linguistic Structure
Adaptor grammars (Johnson et al., 2007b) are a non-parametric Bayesian extension of Probabilistic Context-Free Grammars (PCFGs) which in effect learn the probabilities of entire s...
Mark Johnson