9842 search results - page 1609 / 1969 » The Complexity of the Matching-Cut Problem |
193
click to vote
PODS
2004
ACM
16 years 6 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
165
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
151
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
204
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...
156
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...