Sciweavers

18 search results - page 2 / 4
» Sub-Ramsey Numbers for Arithmetic Progressions
Sort
View
RP
2010
Springer
118views Control Systems» more  RP 2010»
13 years 2 months ago
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
Zdenek Sawa
IJCNN
2008
IEEE
13 years 11 months ago
Efficient and low-complexity image coding with the lifting scheme and modified SPIHT
—In this paper, we propose an efficient and low complexity image coding algorithm based on the lifting wavelet transform and listless modified SPIHT (LWT-LMSPIHT). LWT-LMSPIHT jo...
Hong Pan, Wan-Chi Siu, Ngai-Fong Law
SP
2002
IEEE
165views Security Privacy» more  SP 2002»
13 years 4 months ago
NINJA: Java for high performance numerical computing
When Java was first introduced, there was a perception that its many benefits came at a significant performance cost. In the particularly performance-sensitive field of numerical ...
José E. Moreira, Samuel P. Midkiff, Manish ...
COMBINATORICA
2004
69views more  COMBINATORICA 2004»
13 years 4 months ago
Structural Results For Planar Sets With Many Similar Subsets
Consider a k-element subset P of the plane. It is known that the maximum number of sets similar to P that can be found among n points in the plane is (n2 ) if and only if the cros...
Bernardo M. Ábrego, György Elekes, Sil...
DCC
1995
IEEE
13 years 8 months ago
Quadtree Based JBIG Compression
A JBIG compliant, quadtree based, lossless image compression algorithm is described. In terms of the number of arithmetic coding operations required to code an image, this algorit...
Boyd Fowler, Ronald Arps, Abbas El Gamal, D. Yang