529 search results - page 9 / 106 » The Optimal Fixed Point Combinator |
118
click to vote
MST
2010
14 years 8 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
106
click to vote
CAGD
2006
15 years 1 months ago
2006
We consider parametric curves that are represented by combination of control points and basis functions. We let a control point vary while the rest is held fixed. We show that the...
104
click to vote
ANTSW
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
114
Voted
ECRTS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
150
Voted
SIAMIS
2010
14 years 8 months ago
2010
This article proposes a new method for image separation into a linear combination of morphological components. Sparsity in fixed dictionaries is used to extract the cartoon and osc...