1149 search results - page 68 / 230 » Minimally non-Pfaffian graphs |
LCTRTS
2004
Springer
15 years 5 months ago
2004
Springer
While concurrency in embedded systems is most often supplied by real-time operating systems, this approach can be unpredictable and difficult to debug. Synchronous concurrency, i...
108
click to vote
MTA
2010
14 years 10 months ago
2010
In this paper we present a new approach for automatic summarization of rushes video. Our approach is composed of three main steps. First, based on a temporal segmentation, we filte...
154
click to vote
PKDD
2010
Springer
14 years 9 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
233
click to vote
ECCC
2011
14 years 6 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
103
click to vote
SODA
1992
ACM
15 years 1 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...