Sciweavers

6456 search results - page 395 / 1292
» Constraint Solving on Terms
Sort
View
EVOW
2001
Springer
15 years 11 months ago
Autonomous Photogrammetric Network Design Using Genetic Algorithms
Abstract. This work describes the use of genetic algorithms for automating the photogrammetric network design process. When planning a photogrammetric network, the cameras should b...
Gustavo Olague
ICRA
1999
IEEE
96views Robotics» more  ICRA 1999»
15 years 11 months ago
Interactive Manipulation of Articulated Objects with Geometry Awareness
Techniques for interactive 3D manipulation of articulated objects in cluttered environments should be geometricallyaware, going beyond basic inverse or forward kinematics to allow...
Min-Hyung Choi, James F. Cremer
COLT
1997
Springer
15 years 11 months ago
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
Dimitris Bertsimas, David Gamarnik, John N. Tsitsi...
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
15 years 11 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo
PEPM
1993
ACM
15 years 11 months ago
Binding-Time Analysis and the Taming of C Pointers
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
Lars Ole Andersen