3875 search results - page 416 / 775 » Approximation algorithms for the 0-extension problem |
191
click to vote
ICANN
2009
Springer
15 years 11 months ago
2009
Springer
Recurrent neural networks serve as black-box models for nonlinear dynamical systems identification and time series prediction. Training of recurrent networks typically minimizes t...
168
click to vote
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
171
click to vote
AAAI
1997
15 years 8 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
208
click to vote
SMI
2006
IEEE
16 years 23 days ago
2006
IEEE
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
184
Voted
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...