494 search results - page 65 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative)...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Blind deconvolution is the recovery of a sharp version of
a blurred image when the blur kernel is unknown. Recent
algorithms have afforded dramatic progress, yet many aspects
of...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
AAAI
2010
13 years 9 months ago
2010
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...