5348 search results - page 70 / 1070 » Models for the Compressible Web |
FOSSACS
2007
Springer
15 years 4 months ago
2007
Springer
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...
CRYPTO
2004
Springer
15 years 3 months ago
2004
Springer
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
CGF
2006
14 years 10 months ago
2006
Performances of actual mesh compression algorithms vary significantly depending on the type of model it encodes. These methods rely on prior assumptions on the mesh to be efficient...
CORR
1998
Springer
14 years 9 months ago
1998
Springer
This paper presents trainable methods for generating letter to sound rules from a given lexicon for use in pronouncing out-ofvocabulary words and as a method for lexicon compressi...
DCOSS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...