2698 search results - page 258 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
197
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
155
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Studying metabolic fluxes is a crucial aspect of understanding biological phenotypes. However, it is often not possible to measure these fluxes directly. As an alternative, fluxom...
190
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
205
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
177
click to vote
ICCAD
1993
IEEE
15 years 10 months ago
1993
IEEE
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...