Sciweavers

1091 search results - page 128 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Reconstruction of isometrically deformable flat surfaces in 3D from multiple camera images
This paper deals with the reconstruction of smooth, flexible, isometrically embedded flat surfaces in 3D, such as a sheet of paper or a flag waving in the wind, from a set of 2...
Ricardo Ferreira, João Xavier, João ...
TON
2008
139views more  TON 2008»
13 years 7 months ago
Stochastic learning solution for distributed discrete power control game in wireless data networks
Distributed power control is an important issue in wireless networks. Recently, noncooperative game theory has been applied to investigate interesting solutions to this problem. Th...
Yiping Xing, Rajarathnam Chandramouli
ICANN
2007
Springer
14 years 2 months ago
Input Selection for Radial Basis Function Networks by Constrained Optimization
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
Jarkko Tikka
ICASSP
2011
IEEE
12 years 11 months ago
Computing the nonnegative 3-way tensor factorization using Tikhonov regularization
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
Jean-Philip Royer, Pierre Comon, Nadège Thi...
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
14 years 1 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng