Sciweavers

1945 search results - page 54 / 389
» Speeding up Serpent
Sort
View
TCSV
2002
88views more  TCSV 2002»
14 years 10 months ago
Variable complexity DCT approximations driven by an HVQ-based analyzer
Transform approximations are explored for speeding up the software compression of images and video. Approximations are used to replace the regular discrete cosine transform (DCT) w...
Ricardo L. de Queiroz
TIP
2002
116views more  TIP 2002»
14 years 10 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong
TKDE
2002
127views more  TKDE 2002»
14 years 10 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
MTA
2007
72views more  MTA 2007»
14 years 10 months ago
An improved variable-size block-matching algorithm
In this paper, we proposed an improved “bottom-up” variable-size block matching method. Different from previous work, the proposed method does not need any threshold during th...
Haifeng Wang, Qingshan Liu, Hanqing Lu
RC
2007
78views more  RC 2007»
14 years 10 months ago
Monte-Carlo-Type Techniques for Processing Interval Uncertainty, and Their Potential Engineering Applications
Abstract. In engineering applications, we need to make decisions under uncertainty. Traditionally, in engineering, statistical methods are used, methods assuming that we know the p...
Vladik Kreinovich, Jan Beck, Carlos Ferregut, Arac...