494 search results - page 57 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
163
Voted
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
171
Voted
STACS
2007
Springer
15 years 12 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
151
click to vote
CASC
2007
Springer
15 years 12 months ago
2007
Springer
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
190
click to vote
ICML
2008
IEEE
16 years 6 months ago
2008
IEEE
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
144
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— This paper addresses the problem of acquiring a hierarchically structured robotic skill in a nonstationary environment. This is achieved through a combination of learning primi...