2698 search results - page 521 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
KBSE
1995
IEEE
13 years 11 months ago
1995
IEEE
Numerical design optimization algorithms are highly sensitive to the particular formulation of the optimization problems they are given. The formulation of the search space, the o...
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
TIP
1998
13 years 7 months ago
1998
—We introduce a new approach to image estimation based on a flexible constraint framework that encapsulates meaningful structural image assumptions. Piecewise image models (PIMâ...
BMCBI
2008
13 years 7 months ago
2008
Background: The prediction of conformational B-cell epitopes is one of the most important goals in immunoinformatics. The solution to this problem, even if approximate, would help...
SPAA
2003
ACM
14 years 26 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...