9842 search results - page 1591 / 1969 » The Complexity of the Matching-Cut Problem |
259
Voted
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
361
Voted
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
199
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Scientific workflows are increasingly used for rapid integration of existing algorithms to form larger and more comgrams. Such workflows promise to provide more abstract, yet execu...
189
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
196
Voted
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...