Sciweavers

892 search results - page 82 / 179
» et 2007
Sort
View
AMC
2005
256views more  AMC 2005»
13 years 8 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
ACS
2004
13 years 8 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...
AICOM
2004
92views more  AICOM 2004»
13 years 8 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
14 years 9 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
ACL
2008
13 years 10 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