7930 search results - page 512 / 1586 » Greedy in Approximation Algorithms |
193
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
160
click to vote
COMPGEOM
2006
ACM
16 years 1 months ago
2006
ACM
The medial axis of a shape is known to carry a lot of information about it. In particular a recent result of Lieutier establishes that every bounded open subset of Rn has the same...
208
Voted
ECCV
2000
Springer
15 years 11 months ago
2000
Springer
This paper introduces a new multi-view reconstruction problem called approximate N -view stereo. The goal of this problem is to recover a oneparameter family of volumes that are in...
200
click to vote
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
As application complexity increases, modern embedded systems have adopted heterogeneous processing elements to enhance the computing capability or to reduce the power consumption. ...
177
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...