Sciweavers

3466 search results - page 80 / 694
» Fast computation of special resultants
Sort
View
80
Voted
ICCCN
2007
IEEE
15 years 7 months ago
A Fast Delivery Protocol for Total Order Broadcasting
Abstract—Sequencer, privilege-based, and communication history algorithms are popular approaches to implement total ordering, where communication history algorithms are most suit...
Li Ou, Xubin He, Christian Engelmann, Stephen L. S...
88
Voted
ICA
2007
Springer
15 years 6 months ago
Comparative Speed Analysis of FastICA
FastICA is arguably one of the most widespread methods for independent component analysis. We focus on its deflation-based implementation, where the independent components are ext...
Vicente Zarzoso, Pierre Comon
HPN
1994
15 years 2 months ago
Fast Connection Establishment in the DTM Gigabit Network
Dynamic synchronous Transfer Mode (DTM) is a new protocol suite based on synchronous fast circuit switching. The DTM network is based on bandwidth reservation and supports dynamic...
Per Lindgren, Christer Bohm
CC
2000
Springer
135views System Software» more  CC 2000»
15 years 5 months ago
Fast Escape Analysis and Stack Allocation for Object-Based Programs
A fast and scalable interprocedural escape analysis algorithm is presented. The analysis computes a description of a subset of created objects whose lifetime is bounded by the life...
David Gay, Bjarne Steensgaard
ISLPED
1995
ACM
80views Hardware» more  ISLPED 1995»
15 years 4 months ago
Techniques for fast circuit simulation applied to power estimation of CMOS circuits
We present a transistor level power estimator which exploits algorithms for fast circuit simulation to compute the power dissipation of CMOS circuits. The proposed approach uses s...
Premal Buch, Shen Lin, Vijay Nagasamy, Ernest S. K...