Sciweavers

16091 search results - page 486 / 3219
» Solving
Sort
View
POPL
2008
ACM
16 years 7 months ago
Subcubic algorithms for recursive state machines
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...
Swarat Chaudhuri
VLDB
2007
ACM
130views Database» more  VLDB 2007»
16 years 7 months ago
Model Management and Schema Mappings: Theory and Practice
We present an overview of a tutorial on model management--an approach to solving data integration problems, such as data warehousing, e-commerce, object-to-relational mapping, sch...
Philip A. Bernstein, Howard Ho
EDBT
2008
ACM
236views Database» more  EDBT 2008»
16 years 7 months ago
Virtualization and databases: state of the art and research challenges
ng the abstract view of computing resources from the implementation of these resources of indirection between abstract view and implementation of resources - Hides implementation d...
Ashraf Aboulnaga, Cristiana Amza, Kenneth Salem
ICCAD
2004
IEEE
123views Hardware» more  ICCAD 2004»
16 years 3 months ago
Logical effort based technology mapping
We propose a new approach to library-based technology mapping, based on the method of logical effort. Our algorithm is close to optimal for fanout-free circuits, and is extended t...
Shrirang K. Karandikar, Sachin S. Sapatnekar
STACS
2010
Springer
16 years 1 months ago
The k-in-a-path Problem for Claw-free Graphs
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
Jirí Fiala, Marcin Kaminski, Bernard Lidick...