450 search results - page 56 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
100
click to vote
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
RTSS
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper presents algorithms that (1) facilitate systemindependent synthesis of timing-interfaces for subsystems and (2) system-level selection of interfaces to minimize CPU loa...
ISSAC
2004
Springer
15 years 5 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
RT
2004
Springer
15 years 5 months ago
2004
Springer
We present a novel aggressive visibility preprocessing technique for general 3D scenes. Our technique exploits commodity graphics hardware and is faster than most conservative sol...
PODS
2002
ACM
15 years 12 months ago
2002
ACM
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...