13376 search results - page 352 / 2676 » Problem Solving with |
129
click to vote
SIAMSC
2008
15 years 4 months ago
2008
An effective 2-phase method for removing impulse noise was recently proposed. Its phase 1 identifies noisy pixel candidates by using median-type filters. Then in phase 2, it resto...
119
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
222
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
143
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
149
click to vote
CPAIOR
2006
Springer
15 years 8 months ago
2006
Springer
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...