395 search results - page 32 / 79 » Decision Problems for Convex Languages |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
— A point-to-point discrete-time scheduling problem of transmitting B information bits within T hard delay deadline slots is considered assuming that the underlying energy-bit co...
CSFW
2007
IEEE
14 years 1 months ago
2007
IEEE
Randomized protocols for hiding private information can often be regarded as noisy channels in the informationtheoretic sense, and the inference of the concealed information can b...
ACL
2006
13 years 9 months ago
2006
When training the parameters for a natural language system, one would prefer to minimize 1-best loss (error) on an evaluation set. Since the error surface for many natural languag...