595 search results - page 33 / 119 » Languages Of Analogical Strings |
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
A universally composable (UC) blind signature functionality requres users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. Th...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Geometric Particle Swarm Optimization (GPSO) is a recently introduced formal generalization of traditional Particle Swarm Optimization (PSO) that applies naturally to both continu...
83
Voted
WIA
2007
Springer
15 years 3 months ago
2007
Springer
We study the pattern statistics representing the number of occurrences of a given string in a word of length n generated at random by rational stochastic models, defined by means ...
106
click to vote
COLT
1998
Springer
15 years 1 months ago
1998
Springer
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
95
Voted
NIPS
2001
14 years 11 months ago
2001
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...