874 search results - page 42 / 175 » Faster Algorithms for Semi-Matching Problems |
WSC
2008
15 years 2 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
119
click to vote
ICALP
2009
Springer
16 years 5 days ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
102
click to vote
TIP
2010
14 years 6 months ago
2010
We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where t...
142
click to vote
CPM
1998
Springer
15 years 4 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
111
click to vote
CSCLP
2005
Springer
15 years 5 months ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...