5100 search results - page 588 / 1020 » The Linear Complexity of a Graph |
200
click to vote
CIKM
1998
Springer
15 years 11 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
144
click to vote
WIA
1997
Springer
15 years 10 months ago
1997
Springer
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
187
click to vote
EUROCRYPT
2008
Springer
15 years 8 months ago
2008
Springer
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...
182
click to vote
FORMATS
2008
Springer
15 years 8 months ago
2008
Springer
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model c...
154
click to vote
SDM
2010
SIAM
15 years 8 months ago
2010
SIAM
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...