4526 search results - page 349 / 906 » Algorithmic problems related to the Internet |
177
click to vote
GECCO
2005
Springer
16 years 8 days ago
2005
Springer
The prediction of the native structures of proteins, the socalled protein folding problem, is a NP hard multi-minima optimization problem for which to date no routine solutions ex...
173
click to vote
SODA
1990
ACM
15 years 8 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
153
click to vote
ICALP
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
169
click to vote
CCCG
1994
15 years 8 months ago
1994
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...
165
Voted
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper we study the following problem: given two source images A and A , and a target image B, can we learn to synthesize a new image B which relates to B in the same way t...