Sciweavers

115 search results - page 10 / 23
» Numerical decomposition of geometric constraints
Sort
View
SIAMSC
2010
144views more  SIAMSC 2010»
14 years 8 months ago
A Fully Implicit Domain Decomposition Algorithm for Shallow Water Equations on the Cubed-Sphere
Abstract. Popular approaches for solving the shallow water equations (SWE) for climate modeling are explicit and semi-implicit methods, both have certain constraints on the time st...
Chao Yang, Jianwen Cao, Xiao-Chuan Cai
63
Voted
CVPR
2009
IEEE
15 years 4 months ago
On bias correction for geometric parameter estimation in computer vision
Maximum likelihood (ML) estimation is widely used in many computer vision problems involving the estimation of geometric parameters, from conic fitting to bundle adjustment for s...
Takayuki Okatani, Koichiro Deguchi
GLOBECOM
2006
IEEE
15 years 3 months ago
Optimal Resource Allocation via Geometric Programming for OFDM Broadcast and Multiple Access Channels
Abstract— For multi-user orthogonal frequency division multiplexing (OFDM) systems, efficient optimal rate and power allocation algorithms are presented via geometric programmin...
Kibeom Seong, David D. Yu, Youngjae Kim, John M. C...
IJCAI
1989
14 years 10 months ago
Building a World Model for a Mobile Robot Using Dynamic Semantic Constraints
We are developing a new paradigm for a world model construction system which interprets a scene and builds a world model for a mobile robot using dynamic semantic constraints. The...
Minoru Asada, Yoshiaki Shirai
SIAMJO
2010
130views more  SIAMJO 2010»
14 years 4 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...