720 search results - page 86 / 144 » Linear k-arboricities on trees |
135
click to vote
ICECCS
2007
IEEE
16 years 14 days ago
2007
IEEE
In this paper we summarize parallel algorithms for enumerative model checking of properties formulated in linear time temporal logic (LTL) as well as a fragment of the µcalculus ...
166
click to vote
ICMCS
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper presents an error-resilient coding technique combined with error concealment for embedded wavelet coders. The coded images are partitioned into packets and protected by...
138
click to vote
ISCAS
2005
IEEE
15 years 11 months ago
2005
IEEE
— Based on a Fourier series analysis, an analytic interconnect model is presented which is suitable for periodic signals, such as a clock signal. In this model, the far end time ...
138
click to vote
LPAR
2005
Springer
15 years 11 months ago
2005
Springer
We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. C...
161
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...