3875 search results - page 117 / 775 » Approximation algorithms for the 0-extension problem |
122
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
129
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
147
click to vote
DSD
2005
IEEE
15 years 10 months ago
2005
IEEE
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...
137
click to vote
SIAMJO
2011
14 years 11 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
134
click to vote
ICWS
2009
IEEE
16 years 1 months ago
2009
IEEE
Recently, a new generation of adaptive process management technology has emerged, which enables dynamic changes of composite services and process models respectively. This, in tur...