Sciweavers

441 search results - page 21 / 89
» Optimal Subsequence Bijection
Sort
View
IDA
2009
Springer
15 years 4 months ago
On Optimal Selection of Correlation Matrices for Matrix-Pencil-Based Separation
Abstract. The Matrix-Pencil approach to blind source separation estimates the mixing matrix from the Generalized Eigenvalue Decomposition (GEVD), or Exact Joint Diagonalization, of...
Arie Yeredor
MICRO
2003
IEEE
106views Hardware» more  MICRO 2003»
15 years 2 months ago
Near-Optimal Precharging in High-Performance Nanoscale CMOS Caches
High-performance caches statically pull up the bitlines in all cache subarrays to optimize cache access latency. Unfortunately, such an architecture results in a significant wast...
Se-Hyun Yang, Babak Falsafi
95
Voted
CP
2001
Springer
15 years 2 months ago
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
Rina Dechter, Kalev Kask, Javier Larrosa
IPPS
1997
IEEE
15 years 1 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
109
Voted
TCSV
2010
14 years 4 months ago
Dual Frame Motion Compensation With Optimal Long-Term Reference Frame Selection and Bit Allocation
In dual frame motion compensation (DFMC), one short-term reference frame and one long-term reference frame (LTR) are utilized for motion compensation. The performance of DFMC is he...
Da Liu, Debin Zhao, Xiangyang Ji, Wen Gao