2612 search results - page 368 / 523 » Switching Graphs and Their Complexity |
136
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
140
click to vote
TIT
2011
14 years 11 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
148
click to vote
AAAI
2011
14 years 4 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
261
click to vote
ICDE
2004
IEEE
16 years 5 months ago
2004
IEEE
Twig queries represent the building blocks of declarative query languages over XML data. A twig query describes a complex traversal of the document graph and generates a set of el...
180
click to vote
CONCUR
1998
Springer
15 years 8 months ago
1998
Springer
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...