Sciweavers

1554 search results - page 64 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
98
Voted
CEC
2007
IEEE
15 years 9 months ago
The application of evolutionary multi-criteria optimization to dynamic molecular alignment
— This study introduces the multi-criteria approach to the optimization of dynamic molecular alignment by shaped femtosecond laser pulses, which has been considered so far only a...
Ofer M. Shir, Michael Emmerich, Thomas Bäck, ...
140
Voted
IMR
2003
Springer
15 years 7 months ago
Geodesic-based Surface Remeshing
Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algo...
Oren Sifri, Alla Sheffer, Craig Gotsman
128
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
159
Voted
PODC
2009
ACM
16 years 3 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
134
Voted
IWOCA
2009
Springer
132views Algorithms» more  IWOCA 2009»
15 years 9 months ago
Fast Convolutions and Their Applications in Approximate String Matching
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
Kimmo Fredriksson, Szymon Grabowski