Sciweavers

6365 search results - page 1000 / 1273
» Fast Local Computation Algorithms
Sort
View
ICS
1994
Tsinghua U.
15 years 10 months ago
Fault-tolerant wormhole routing in tori
Abstract. We present a method to enhance wormhole routing algorithms for deadlock-free fault-tolerant routing in tori. We consider arbitrarily-located faulty blocks and assume only...
Suresh Chalasani, Rajendra V. Boppana
DAC
2005
ACM
15 years 8 months ago
Timing-driven placement by grid-warping
Grid-warping is a recent placement strategy based on a novel physical analogy: rather than move the gates to optimize their location, it elastically deforms a model of the 2-D chi...
Zhong Xiu, Rob A. Rutenbar
CVPR
2008
IEEE
15 years 8 months ago
A rank constrained continuous formulation of multi-frame multi-target tracking problem
This paper presents a multi-frame data association algorithm for tracking multiple targets in video sequences. Multi-frame data association involves finding the most probable corr...
Khurram Shafique, Mun Wai Lee, Niels Haering
PARCO
2003
15 years 8 months ago
Cache Memory Behavior of Advanced PDE Solvers
Three different partial differential equation (PDE) solver kernels are analyzed in respect to cache memory performance on a simulated shared memory computer. The kernels implement...
Dan Wallin, Henrik Johansson, Sverker Holmgren
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 6 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
« Prev « First page 1000 / 1273 Last » Next »