Sciweavers

205 search results - page 21 / 41
» On Parameterized Approximability
Sort
View
APPROX
2008
Springer
173views Algorithms» more  APPROX 2008»
14 years 27 days ago
Connected Vertex Covers in Dense Graphs
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
Jean Cardinal, Eythan Levy
INFOCOM
2009
IEEE
14 years 5 months ago
Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
Chee-Wei Tan, Mung Chiang, R. Srikant
CAGD
2008
125views more  CAGD 2008»
13 years 11 months ago
On geometric Lagrange interpolation by quadratic parametric patches
In the paper, the geometric Lagrange interpolation by quadratic parametric patches is considered. The freedom of parameterization is used to raise the number of interpolated point...
Gasper Jaklic, Jernej Kozak, Marjeta Krajnc, Vito ...
COMPUTING
2007
81views more  COMPUTING 2007»
13 years 11 months ago
Hybrid curve fitting
We consider a parameterized family of closed planar curves and introduce an evolution process for identifying a member of the family that approximates a given unorganized point cl...
Martin Aigner, Bert Jüttler
ICASSP
2011
IEEE
13 years 2 months ago
Nonnegative 3-way tensor factorization via conjugate gradient with globally optimal stepsize
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
Jean-Philip Royer, Pierre Comon, Nadège Thi...