1732 search results - page 23 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
129
click to vote
IPCO
1996
15 years 7 months ago
1996
We analyse a continued fraction algorithm (abbreviated CFA) for arbitrary dimension n showing that it produces simultaneous diophantine approximations which are up to the factor 2(...
162
click to vote
ESA
2008
Springer
15 years 7 months ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
147
click to vote
ASAP
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper focuses on SIMD implementations of the 2D discrete wavelet transform (DWT). The transforms considered are Daubechies’ real-to-real method of four coefficients (Daub-...
153
click to vote
DM
1999
15 years 5 months ago
1999
Let G be a simple graph with n( 2) vertices, and i(G) be the ith largest eigenvalue of G. In this paper we obtain the following: If 3(G) < 0, and there exists some index k, 2 ...
189
click to vote
CLOR
2006
15 years 9 months ago
2006
Abstract. A popular framework for the interpretation of image sequences is the layers or sprite model, see e.g. [1], [2]. Jojic and Frey [3] provide a generative probabilistic mode...