Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ISCAS
2006
IEEE
118views Hardware» more  ISCAS 2006»
10 years 10 months ago
A robust continuous-time multi-dithering technique for laser communications using adaptive optics
A robust system architecture to achieve optical coherency free optimization. Several methods that had been proposed in the in multiple-beam free-space laser communication links wit...
Dimitrios N. Loizos, Paul-Peter Sotiriadis, Gert C...
CVPR
2006
IEEE
10 years 10 months ago
Fast Variational Segmentation using Partial Extremal Initialization
In this paper we consider region-based variational segmentation of two- and three-dimensional images by the minimization of functionals whose fidelity term is the quotient of two...
Jan Erik Solem, Niels Chr. Overgaard, Markus Perss...
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
10 years 10 months ago
Empirical analysis of generalization and learning in XCS with gradient descent
We analyze generalization and learning in XCS with gradient descent. At first, we show that the addition of gradient in XCS may slow down learning because it indirectly decreases...
Pier Luca Lanzi, Martin V. Butz, David E. Goldberg
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
10 years 10 months ago
A Fast Optimization Method for Level Set Segmentation
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
Thord Andersson, Gunnar Läthén, Reiner...
SCALESPACE
2009
Springer
10 years 10 months ago
Momentum Based Optimization Methods for Level Set Segmentation
Abstract. Segmentation of images is often posed as a variational problem. As such, it is solved by formulating an energy functional depending on a contour and other image derived t...
Gunnar Läthén, Thord Andersson, Reiner...
WWW
2010
ACM
10 years 11 months ago
Web-scale k-means clustering
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
D. Sculley
books