Sciweavers

1686 search results - page 276 / 338
» Programs as polygraphs: computability and complexity
Sort
View
COR
2007
87views more  COR 2007»
14 years 9 months ago
An exact algorithm for generating homogenous T-shape cutting patterns
Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-d...
Yaodong Cui
ICPP
2008
IEEE
15 years 4 months ago
Optimizing JPEG2000 Still Image Encoding on the Cell Broadband Engine
JPEG2000 is the latest still image coding standard from the JPEG committee, which adopts new algorithms such as Embedded Block Coding with Optimized Truncation (EBCOT) and Discret...
Seunghwa Kang, David A. Bader
SI3D
2005
ACM
15 years 3 months ago
Texture sprites: texture elements splatted on surfaces
We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We ...
Sylvain Lefebvre, Samuel Hornus, Fabrice Neyret
AFPAC
2000
Springer
341views Mathematics» more  AFPAC 2000»
15 years 2 months ago
An Associative Perception-Action Structure Using a Localized Space Variant Information Representation
Abstract. Most of the processing in vision today uses spatially invariant operations. This gives efficient and compact computing structures, with the conventional convenient separa...
Gösta H. Granlund
STACS
1999
Springer
15 years 2 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...