Sciweavers

210 search results - page 19 / 42
» Uniform regular enumerations
Sort
View
EMNLP
2008
13 years 8 months ago
A Discriminative Candidate Generator for String Transformations
String transformation, which maps a source string s into its desirable form t , is related to various applications including stemming, lemmatization, and spelling correction. The ...
Naoaki Okazaki, Yoshimasa Tsuruoka, Sophia Ananiad...
NC
2008
126views Neural Networks» more  NC 2008»
13 years 7 months ago
Spiking neural P systems with extended rules: universality and languages
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
Haiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj,...
FOCS
2000
IEEE
13 years 12 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
CPC
2002
95views more  CPC 2002»
13 years 7 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
PAMI
1998
86views more  PAMI 1998»
13 years 7 months ago
Spatial Sampling of Printed Patterns
—The bitmap obtained by scanning a printed pattern depends on the exact location of the scanning grid relative to the pattern. We consider ideal sampling with a regular lattice o...
Prateek Sarkar, George Nagy, Jiangying Zhou, Danie...