Sciweavers

354 search results - page 3 / 71
» Recovery Rate of Clustering Algorithms
Sort
View
ICCAD
2005
IEEE
98views Hardware» more  ICCAD 2005»
15 years 6 months ago
Clustering for processing rate optimization
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
Chuan Lin, Jia Wang, Hai Zhou
CORR
2008
Springer
144views Education» more  CORR 2008»
14 years 9 months ago
Iterative Hard Thresholding for Compressed Sensing
Compressed sensing is a technique to sample compressible signals below the Nyquist rate, whilst still allowing near optimal reconstruction of the signal. In this paper we present ...
Thomas Blumensath, Mike E. Davies
CSMR
2004
IEEE
15 years 1 months ago
The Weighted Combined Algorithm: A Linkage Algorithm for Software Clustering
Software systems need to evolve as business requirements, technology and environment change. As software is modified to accommodate the required changes, its structure deteriorate...
Onaiza Maqbool, Haroon A. Babri
MOBIDE
2005
ACM
15 years 3 months ago
Recovery of mobile internet transactions: algorithm, implementation and analysis
The increasing popularity of mobile devices and the support of web portals towards performing transactions from these mobile devices has enabled business on the move. However, int...
Shashi Anand, Krithi Ramamritham
TIT
2010
100views Education» more  TIT 2010»
14 years 4 months ago
Theoretical and empirical results for recovery from multiple measurements
The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an ex...
Ewout van den Berg, Michael P. Friedlander