Sciweavers

306 search results - page 33 / 62
» On the Minimal Uncompletable Word Problem
Sort
View
154
Voted
SIAMMAX
2011
141views more  SIAMMAX 2011»
14 years 6 months ago
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
Mariya Ishteva, Pierre-Antoine Absil, Sabine Van H...
121
Voted
COMCOM
2010
131views more  COMCOM 2010»
15 years 2 months ago
Level the buffer wall: Fair channel assignment in wireless sensor networks
—In this paper, we study the trade-off between network throughput and fairness in a multi-channel enabled WSN. Traditional approaches attempt to solve the two problems in an isol...
Yanyan Yang, Yunhuai Liu, Lionel M. Ni
228
Voted
MP
2011
14 years 6 months ago
An interior-point piecewise linear penalty method for nonlinear programming
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
Lifeng Chen, Donald Goldfarb
169
Voted
MP
2002
195views more  MP 2002»
15 years 3 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
125
Voted
AI
2011
Springer
14 years 10 months ago
Contracting preference relations for database applications
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
Denis Mindolin, Jan Chomicki