2128 search results - page 214 / 426 » A general characterization of indulgence |
171
click to vote
MFCS
1998
Springer
15 years 10 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
205
click to vote
CIVR
2004
Springer
15 years 10 months ago
2004
Springer
Earlier this year, a major effort was initiated to study the theoretical and empirical aspects of the automatic detection of semantic concepts in broadcast video, complementing ong...
184
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, pa...
215
click to vote
CCS
2010
ACM
15 years 6 months ago
2010
ACM
Models based on system calls are a popular and common approach to characterize the run-time behavior of programs. For example, system calls are used by intrusion detection systems...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...