Sciweavers

178 search results - page 12 / 36
» On the Implementation of a Fast Prime Generation Algorithm
Sort
View
VRST
2005
ACM
14 years 1 months ago
Artistic reality: fast brush stroke stylization for augmented reality
The goal of augmented reality is to provide the user with a view of the surroundings enriched by virtual objects. Practically all augmented reality systems rely on standard realti...
Jan Fischer, Dirk Bartz, Wolfgang Straßer
GLVLSI
2006
IEEE
185views VLSI» more  GLVLSI 2006»
14 years 1 months ago
Application of fast SOCP based statistical sizing in the microprocessor design flow
In this paper we have applied statistical sizing in an industrial setting. Efficient implementation of the statistical sizing algorithm is achieved by utilizing a dedicated interi...
Murari Mani, Mahesh Sharma, Michael Orshansky
HIPEAC
2010
Springer
13 years 9 months ago
Computer Generation of Efficient Software Viterbi Decoders
This paper presents a program generator for fast software Viterbi decoders for arbitrary convolutional codes. The input to the generator is a specification of the code and a single...
Frédéric de Mesmay, Srinivas Chellap...
EOR
2007
73views more  EOR 2007»
13 years 7 months ago
Complete and robust no-fit polygon generation for the irregular stock cutting problem
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
Edmund K. Burke, Robert S. R. Hellier, Graham Kend...
CGF
2008
128views more  CGF 2008»
13 years 7 months ago
Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
Marco Attene, Michela Mortara, Michela Spagnuolo, ...