Sciweavers

4131 search results - page 200 / 827
» Compactness in Topology and Computation
Sort
View
CVGIP
2002
174views more  CVGIP 2002»
15 years 6 months ago
Computing quadric surface intersections based on an analysis of plane cubic curves
Computing the intersection curve of two quadrics is a fundamental problem in computer graphics and solid modeling. We present an algebraic method for classifying and parameterizin...
Wenping Wang, Barry Joe, Ronald N. Goldman
CLUSTER
2006
IEEE
16 years 17 days ago
SLA-Based Coordinated Superscheduling Scheme for Computational Grids
The Service Level Agreement (SLA) based grid superscheduling approach promotes coordinated resource sharing. Superscheduling is facilitated between administratively and topologica...
Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
16 years 2 days ago
Parallel FFT computation with a CDMA-based network-on-chip
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...
Daewook Kim, Manho Kim, Gerald E. Sobelman
ARCS
2005
Springer
16 years 1 days ago
The Bio-Chemical Information Processing Metaphor as a Programming Paradigm for Organic Computing
All known life forms process information on a molecular level. This kind of chemical information processing is known to be robust, self-organizing, adaptive, decentralized, asynch...
Peter Dittrich
ICDCSW
2003
IEEE
15 years 11 months ago
Computation of Minimal Uniform Transmission Power in Ad Hoc Wireless Networks
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
Qing Dai, Jie Wu