3875 search results - page 60 / 775 » Approximation algorithms for the 0-extension problem |
SIAMSC
2010
14 years 8 months ago
2010
Abstract. A problem that arises in slice-selective magnetic resonance imaging (MRI) radiofrequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with...
IPL
2002
14 years 9 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract-- We consider reinforcement learning, and in particular, the Q-learning algorithm in large state and action spaces. In order to cope with the size of the spaces, a functio...
IPL
2010
14 years 8 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
194
click to vote
SDM
2011
SIAM
14 years 15 days ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...