Sciweavers

391 search results - page 48 / 79
» Efficient Self-Reconfigurable Implementations Using On-chip ...
Sort
View
SPAA
1996
ACM
13 years 12 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
FPL
2006
Springer
96views Hardware» more  FPL 2006»
13 years 11 months ago
Reducing the Space Complexity of Pipelined Routing Using Modified Range Encoding
Interconnect delays are becoming an increasingly significant part of the critical path delay for circuits implemented in FPGAs. Pipelined interconnects have been proposed to addre...
Allan Carroll, Carl Ebeling
IJCV
2002
256views more  IJCV 2002»
13 years 7 months ago
Fast Stereo Matching Using Rectangular Subregioning and 3D Maximum-Surface Techniques
This paper presents a fast and reliable stereo matching algorithm which produces a dense disparity map by using fast cross correlation, rectangular subregioning (RSR) and 3D maxim...
Changming Sun
ALMOB
2006
80views more  ALMOB 2006»
13 years 7 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
POPL
2005
ACM
14 years 8 months ago
Region-based shape analysis with tracked locations
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...
Brian Hackett, Radu Rugina