Sciweavers

131 search results - page 5 / 27
» Interval Arithmetic with Containment Sets
Sort
View
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 7 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
13 years 11 months ago
Robust symbolic regression with affine arithmetic
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
Cassio Pennachin, Moshe Looks, João A. de V...
COMPGEOM
1998
ACM
13 years 11 months ago
Rotational Polygon Containment and Minimum Enclosure
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
Victor Milenkovic
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
14 years 7 months ago
Containment Join Size Estimation: Models and Methods
Recent years witnessed an increasing interest in researches in XML, partly due to the fact that XML has now become the de facto standard for data interchange over the internet. A ...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
JCSS
2010
105views more  JCSS 2010»
13 years 6 months ago
Fast convolution and Fast Fourier Transform under interval and fuzzy uncertainty
Convolution y(t) = a(t − s) · x(s) ds is one of the main techniques in digital signal processing. A straightforward computation of the convolution y(t) requires O(n2) steps, wh...
Guoqing Liu, Vladik Kreinovich