Sciweavers

16 search results - page 1 / 4
» On Compact Representations of All-Pairs-Shortest-Path-Distan...
Sort
View
CPM
2008
Springer
149views Combinatorics» more  CPM 2008»
14 years 19 days ago
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
Let G be an unweighted and undirected graph of n nodes, and let D be the n
Igor Nitto, Rossano Venturini
ICPR
2008
IEEE
15 years 1 days ago
Beyond SVD: Sparse projections onto exemplar orthonormal bases for compact image representation
We present a new method for compact representation of large image datasets. Our method is based on treating small patches from an image as matrices as opposed to the conventional ...
Ajit Rajwade, Anand Rangarajan, Arunava Banerjee, ...
ICPR
2004
IEEE
14 years 12 months ago
Compact Representation of Multidimensional Data Using Tensor Rank-One Decomposition
This paper presents a new approach for representing multidimensional data by a compact number of bases. We consider the multidimensional data as tensors instead of matrices or vec...
Hongcheng Wang, Narendra Ahuja
ICCAD
2006
IEEE
133views Hardware» more  ICCAD 2006»
14 years 7 months ago
Stable and compact inductance modeling of 3-D interconnect structures
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
Hong Li, Venkataramanan Balakrishnan, Cheng-Kok Ko...
CTRSA
2005
Springer
108views Cryptology» more  CTRSA 2005»
14 years 4 months ago
A Systematic Evaluation of Compact Hardware Implementations for the Rijndael S-Box
This work proposes a compact implementation of the AES S-box using composite field arithmetic in GF(((22 ) 2 ) 2 ). It describes a systematic exploration of different choices for...
Nele Mentens, Lejla Batina, Bart Preneel, Ingrid V...