Sciweavers

1469 search results - page 204 / 294
» Approximate polynomial decomposition
Sort
View
ECCV
2002
Springer
16 years 8 months ago
Learning Shape from Defocus
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
Paolo Favaro, Stefano Soatto
CEC
2009
IEEE
16 years 1 months ago
Enhancing MOEA/D with guided mutation and priority update for multi-objective optimization
—Multi-objective optimization is an essential and challenging topic in the domains of engineering and computation because real-world problems usually include several conflicting...
Chih-Ming Chen, Ying-Ping Chen, Qingfu Zhang
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 11 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
DASFAA
2003
IEEE
108views Database» more  DASFAA 2003»
15 years 11 months ago
Spatial Query Processing for High Resolutions
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems a...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SIAMMAX
2010
146views more  SIAMMAX 2010»
15 years 1 months ago
A Comparison of Two-Level Preconditioners Based on Multigrid and Deflation
It is well-known that two-level and multi-level preconditioned conjugate gradient (PCG) methods provide efficient techniques for solving large and sparse linear systems whose coeff...
J. M. Tang, S. P. MacLachlan, Reinhard Nabben, C. ...