Sciweavers

13500 search results - page 217 / 2700
» Improved analysis of D
Sort
View
CEC
2005
IEEE
16 years 4 days ago
On improving genetic programming for symbolic regression
This paper reports an improvement to genetic programming (GP) search for the symbolic regression domain, based on an analysis of dissimilarity and mating. GP search is generally di...
Steven Gustafson, Edmund K. Burke, Natalio Krasnog...
ICDAR
2003
IEEE
15 years 11 months ago
An Improved Parallel Thinning Algorithm
This paper describes an improved thinning algorithm for binary images. We improve thinning algorithm from the fundamental properties such as connectivity, onepixel width, robust t...
Lei Huang, Genxun Wan, Changping Liu
LSSC
2005
Springer
16 years 21 hour ago
Improved Solution Enclosures for Over- and Underdetermined Interval Linear Systems
Abstract. In this paper we discuss an inclusion method for solving rectangular (over- and under-determined) dense linear systems where the input data are uncertain and vary within ...
Evgenija D. Popova
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 8 months ago
Improved approximation algorithms for rectangle tiling and packing
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, ...
CORR
2010
Springer
154views Education» more  CORR 2010»
15 years 6 months ago
Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms
ABSTRACT. In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorit...
M. A. Iwen