656 search results - page 57 / 132 » Graph Theoretical Characterization and Computation of Answer... |
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
MFCS
1997
Springer
13 years 11 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
IFIPTCS
2010
13 years 5 months ago
2010
We introduce a simple logic that allows to quantify over the subobjects of a categorical object. We subsequently show that, for the category of graphs, this logic is equally expres...
ENC
2004
IEEE
13 years 11 months ago
2004
IEEE
This article deals with the problem of data cache for dynamic web servers. A set of requests (which number could be large) is submitted to a server for computing. Every request is...