Sciweavers

13603 search results - page 382 / 2721
» On the Complexity of Computing Treelength
Sort
View
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 7 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
ICIP
2003
IEEE
16 years 9 months ago
Non-linear 3D rendering workload prediction based on a combined fuzzy-neural network architecture for grid computing application
Although, computational Grid has been initially developed to solve large-scale scientific research problems, it is extended for commercial and industrial applications. An interest...
John K. Doulamis, Anastasios D. Doulamis
DAC
2007
ACM
16 years 8 months ago
Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs
A key step in the design of cyclo-static real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure, which means that tasks...
Maarten Wiggers, Marco Bekooij, Gerard J. M. Smit
PODS
2006
ACM
96views Database» more  PODS 2006»
16 years 7 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
FCCM
2005
IEEE
107views VLSI» more  FCCM 2005»
16 years 1 months ago
Simplifying the Integration of Processing Elements in Computing Systems Using a Programmable Controller
As technology sizes decrease and die area increases, designers are creating increasingly complex computing systems using FPGAs. To reduce design time for new products, the reuse o...
Lesley Shannon, Paul Chow