Sciweavers

2745 search results - page 147 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
TASE
2011
IEEE
14 years 7 months ago
Fast Intersection-Free Offset Surface Generation From Freeform Models With Triangular Meshes
Abstract—A fast offset surface generation approach is presented in this paper to construct intersection-free offset surfaces, which preserve sharp features, from freeform triangu...
Shengjun Liu, Charlie C. L. Wang
135
Voted
IFIP
2003
Springer
15 years 9 months ago
Collaborative and Distributed Computation in Mesh-Like Wireless Sensor Arrays
Sensor networks are being used for implementation of a large number of applications involving distributed and collaborative computation. Extensive research has focused upon design ...
Mitali Singh, Viktor K. Prasanna, José D. P...
P2P
2009
IEEE
143views Communications» more  P2P 2009»
15 years 10 months ago
SimGrid: a Generic Framework for Large-Scale Distributed Experiments
Distributed computing is a very broad and active research area comprising fields such as cluster computing, computational grids, desktop grids and peer-to-peer (P2P) systems. Unf...
Martin Quinson
ARITH
2005
IEEE
15 years 5 months ago
Error-Free Computation of 8x8 2-D DCT and IDCT Using Two-Dimensional Algebraic Integer Quantization
This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of both 2-D Discrete Cosine Transform and Inverse DCT. The architecture uses a...
Khan Wahid, Vassil S. Dimitrov, Graham A. Jullien
106
Voted
ICSE
2003
IEEE-ACM
16 years 4 months ago
Precise Dynamic Slicing Algorithms
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang