Sciweavers

530 search results - page 66 / 106
» Structural and Complexity Aspects of Line Systems of Graphs
Sort
View
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
15 years 5 months ago
On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Jakob Nordström
DAC
1994
ACM
15 years 6 months ago
BDD Variable Ordering for Interacting Finite State Machines
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
Adnan Aziz, Serdar Tasiran, Robert K. Brayton
EDBT
2008
ACM
141views Database» more  EDBT 2008»
16 years 2 months ago
Generating Highly Customizable SQL Parsers
Database technology and the Structured Query Language (SQL) have grown enormously in recent years. Applications from different domains have different requirements for using databa...
Gunter Saake, Marko Rosenmüller, Martin Kuhle...
133
Voted
DRM
2005
Springer
15 years 7 months ago
DRM interoperability analysis from the perspective of a layered framework
Interoperability is currently seen as one of the most significant problems facing the digital rights management (DRM) industry. In this paper we consider the problem of interoper...
Gregory L. Heileman, Pramod A. Jamkhedkar
IJCAI
2003
15 years 3 months ago
Concept Linking for Information Integration in Open Book and Sentinel
Opening up large amounts of loosely structured information for easy access and use is a complex problem. This paper describes two systems that address different aspects of the pro...
Stuart Watt