Sciweavers

530 search results - page 69 / 106
» A New Iterative Method for Solving Initial Value Problems
Sort
View
JGS
2006
154views more  JGS 2006»
13 years 7 months ago
Area-to-point Kriging with inequality-type data
In practical applications of area-to-point spatial interpolation, inequality constraints, such as non-negativity, or more general constraints on the maximum and/or minimum allowab...
E.-H. Yoo, Phaedon C. Kyriakidis
3DIM
2007
IEEE
14 years 1 months ago
A Bayesian Framework for Simultaneous Matting and 3D Reconstruction
Conventional approaches to 3D scene reconstruction often treat matting and reconstruction as two separate problems, with matting a prerequisite to reconstruction. The problem with...
Jean-Yves Guillemaut, Adrian Hilton, Jonathan Star...
DAC
2009
ACM
14 years 8 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
TSP
2010
13 years 2 months ago
Code design for radar STAP via optimization theory
Abstract--In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. ...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
CP
2003
Springer
14 years 24 days ago
Terminating Decision Algorithms Optimally
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
Tuomas Sandholm