136 search results - page 25 / 28 » The Satisfiability Problem for Probabilistic Ordered Branchi... |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
MM
2003
ACM
14 years 27 days ago
2003
ACM
In this paper, we present a system that automates home video editing. This system automatically extracts a set of highlight segments from a set of raw home videos and aligns them ...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
WIOPT
2006
IEEE
14 years 1 months ago
2006
IEEE
A state-of-the-art orthogonal frequency division multiplexing (OFDM)-based access system, such as the DiffSeg system [1][2], uses a different set of transmission technologies, e.g...