Sciweavers

279 search results - page 7 / 56
» Type-II Optimal Polynomial Bases
Sort
View
ADCM
2005
79views more  ADCM 2005»
13 years 8 months ago
Flexible piecewise approximations based on partition of unity
In this paper, we study a flexible piecewise approximation technique based on the use of the idea of the partition of unity. The approximations are piecewisely defined, globally sm...
Weimin Han, Wing Kam Liu
ASAP
1995
IEEE
145views Hardware» more  ASAP 1995»
14 years 8 days ago
An array processor for inner product computations using a Fermat number ALU
This paper explores an architecture for parallel independent computations of inner products over the direct product ring . The structure is based on the polynomial mapping of the ...
Wenzhe Luo, Graham A. Jullien, Neil M. Wigley, Wil...
SODA
2010
ACM
143views Algorithms» more  SODA 2010»
13 years 7 months ago
Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh...
IJCV
2012
11 years 11 months ago
Globally Optimal Estimation of Nonrigid Image Distortion
Abstract Image alignment in the presence of non-rigid distortions is a challenging task. Typically, this involves estimating the parameters of a dense deformation field that warps...
Yuandong Tian, Srinivasa G. Narasimhan
CISSE
2009
Springer
13 years 6 months ago
Optimal Component Selection for Component-Based Systems
In Component-based Software (CBS) development, it is desirable to choose software components that provide all necessary functionalities and at the same time optimize certain nonfun...
Muhammad Ali Khan, Sajjad Mahmood