Sciweavers

6365 search results - page 82 / 1273
» Fast Local Computation Algorithms
Sort
View
SIGGRAPH
1996
ACM
15 years 6 months ago
VC-1: A Scalable Graphics Computer with Virtual Local Frame Buffers
The VC-1 is a parallel graphics machine for polygon rendering based on image composition. This paper describes the architecture of the VC-1 along with a parallel polygon rendering...
Satoshi Nishimura, Tosiyasu L. Kunii
ALGOSENSORS
2004
Springer
15 years 7 months ago
On the Computational Complexity of Sensor Network Localization
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
James Aspnes, David Kiyoshi Goldenberg, Yang Richa...
ICIP
2007
IEEE
15 years 8 months ago
Fast Computation of Zernike Moments For Rice Sorting System
— In a rice sorting system, the separation distance of one grain from another is determined by the amount of time taken to process the image of each grain. The closer the separat...
Chong-Yaw Wee, Paramesran Raveendran, Fumiaki Take...
MOC
2002
135views more  MOC 2002»
15 years 2 months ago
A fast spherical harmonics transform algorithm
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a dr...
Reiji Suda, Masayasu Takami
JUCS
2002
179views more  JUCS 2002»
15 years 2 months ago
A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
Bruce W. Watson