275 search results - page 32 / 55 » Parameterized Complexity of Generalized Vertex Cover Problem... |
123
click to vote
WEBDB
2004
Springer
15 years 9 months ago
2004
Springer
We consider the scenario where existing relational data is exported as XML. In this context, we look at the problem of translating XML queries into SQL. XML query languages have t...
174
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
165
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
119
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
148
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...