2018 search results - page 316 / 404 » Code Normal Forms |
127
Voted
CONCUR
2009
Springer
15 years 8 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
92
Voted
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
130
Voted
SIGIR
2009
ACM
15 years 8 months ago
2009
ACM
The selection of indexing terms for representing documents is a key decision that limits how effective subsequent retrieval can be. Often stemming algorithms are used to normaliz...
124
Voted
CISS
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
116
Voted
LICS
2008
IEEE
15 years 8 months ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...