Sciweavers

3143 search results - page 255 / 629
» Minimization of entropy functionals
Sort
View
IJCNN
2007
IEEE
15 years 11 months ago
Optimizing 0/1 Loss for Perceptrons by Random Coordinate Descent
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
Ling Li, Hsuan-Tien Lin
GI
2007
Springer
15 years 10 months ago
A New Approach for Estimating Depth by Fusing Stereo and Defocus Information
: Several algorithms are common for estimating depth from stereo series, but many of them have difficulties when determining depth of objects having periodical structure. This con...
Ioana Gheta, Christian Frese, Michael Heizmann, J&...
146
Voted
LION
2007
Springer
138views Optimization» more  LION 2007»
15 years 10 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
116
Voted
CSB
2005
IEEE
114views Bioinformatics» more  CSB 2005»
15 years 10 months ago
EigenPhenotypes: Towards an Algorithmic Framework for Phenotype Discovery
Studying the genetic control of molecular, anatomical and/or morphological phenotypes in model organisms is a powerful tool in the functional analysis of a gene. The goal of our r...
Alexander Vaughan, Rahul Singh, Ilmi Yoon, Megumi ...
EUC
2005
Springer
15 years 10 months ago
Optimal Multicast Loop Algorithm for Multimedia Traffic Distribution
Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...
Yong-Jin Lee, Mohammed Atiquzzaman