Sciweavers

16504 search results - page 113 / 3301
» New Problems, New Solutions
Sort
View
ECML
2007
Springer
16 years 16 days ago
Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
Mark Schmidt, Glenn Fung, Rómer Rosales
NCI
2004
125views Neural Networks» more  NCI 2004»
15 years 7 months ago
A new approach to blind source separation with global optimal property
This paper presents a new independency metric for blind source separation (BSS) problem. It is mathematically proved that the metric value of any linear combination of source sign...
Yiu-ming Cheung, Hailin Liu
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
15 years 11 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
16 years 16 days ago
A new evolutionary model for detecting multiple optima
Multimodal optimization problems consist in detecting all global and local optima of a problem. A new evolutionary approach to multimodal optimization called Roaming technique (RO...
Rodica Ioana Lung, D. Dumitrescu
EUROPAR
2005
Springer
15 years 12 months ago
New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...
Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...