2654 search results - page 28 / 531 » On Pairing Inversion Problems |
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds dia...
104
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Many problems in machine learning and statistics can be formulated as (generalized) eigenproblems. In terms of the associated optimization problem, computing linear eigenvectors a...
118
Voted
ALMOB
2006
15 years 1 months ago
2006
Background: Bifurcation analysis has proven to be a powerful method for understanding the qualitative behavior of gene regulatory networks. In addition to the more traditional for...
ICRA
2003
IEEE
15 years 6 months ago
2003
IEEE
— This paper formulates and solves the inverse dynamics problem of deformable robots made entirely of electro-active polymer gel. One of the primary difficulties with deformable...