536 search results - page 39 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper deals with the joint estimation of temporal (timedelay, Doppler frequency) and spatial (direction-of-arrival, DOA) parameters of several replicas of a known signal in a...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
EC
2010
13 years 8 months ago
2010
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...