Sciweavers

4488 search results - page 224 / 898
» Properties of NP-Complete Sets
Sort
View
JSC
2010
102views more  JSC 2010»
15 years 5 months ago
Equational approximations for tree automata completion
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
Thomas Genet, Vlad Rusu
ORDER
2010
110views more  ORDER 2010»
15 years 5 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
15 years 4 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
206
Voted
MTA
2011
203views Hardware» more  MTA 2011»
15 years 1 months ago
Interoperable digital rights management based on the MPEG Extensible Middleware
Abstract This paper describes an interoperable Digital Rights Management architecture promoted by the MPEG standardization group in its new standard known as MPEG-M or MPEG Extensi...
Víctor Rodríguez-Doncel, Jaime Delga...
JMLR
2010
187views more  JMLR 2010»
15 years 1 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause