Sciweavers

311 search results - page 46 / 63
» Exploiting Decomposition in Constraint Optimization Problems
Sort
View
VC
2011
106views more  VC 2011»
13 years 2 months ago
Width-bounded geodesic strips for surface tiling
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
Joe Kahlert, Matt Olson, Hao Zhang 0002
ICASSP
2011
IEEE
12 years 11 months ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...
PAMI
2012
11 years 11 months ago
Simultaneous Video Stabilization and Moving Object Detection in Turbulence
Turbulence mitigation refers to the stabilization of videos with non-uniform deformations due to the influence of optical turbulence. Typical approaches for turbulence mitigation ...
Omar Oreifej, Xin Li, and Mubarak Shah
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
14 years 1 months ago
Genetic optimization for yacht design
This paper introduces a procedure for using genetic multiobjective optimization in yacht design. The problem described consists on the optimization of a bulb shape to improve the ...
Paolo Geremia, Mauro Poian, Silvia Poles
SECON
2010
IEEE
13 years 5 months ago
Multi-Constrained Anypath Routing in Wireless Mesh Networks
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...
Xi Fang, Dejun Yang, Pritam Gundecha, Guoliang Xue