275 search results - page 40 / 55 » Parameterized Complexity of Generalized Vertex Cover Problem... |
162
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
132
click to vote
DCC
2004
IEEE
16 years 3 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
137
click to vote
AAAI
2004
15 years 5 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
142
click to vote
IS
2007
15 years 4 months ago
2007
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
150
click to vote
COMGEO
2012
ACM
14 years 13 hour ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...