Sciweavers

7129 search results - page 686 / 1426
» Approximation Algorithms for Treewidth
Sort
View
232
Voted
ICPR
2008
IEEE
16 years 8 months ago
EK-SVD: Optimized dictionary design for sparse representations
Sparse representations using overcomplete dictionaries are used in a variety of field such as pattern recognition and compression. However, the size of dictionary is usually a tra...
Raazia Mazhar, Paul D. Gader
ICPR
2006
IEEE
16 years 8 months ago
Epipolar Geometry from Two Correspondences
A novel algorithm for robust RANSAC-like estimation of epipolar geometry (of uncalibrated camera pair) from two correspondences of local affine frames (LAFs) is presented. Each LA...
Michal Perdoch, Jiri Matas, Ondrej Chum
VLSID
2006
IEEE
240views VLSI» more  VLSID 2006»
16 years 7 months ago
An Efficient and Accurate Logarithmic Multiplier Based on Operand Decomposition
Logarithmic Number Systems (LNS) offer a viable alternative in terms of area, delay and power to binary number systems for multiplication and division operations in signal process...
Venkataraman Mahalingam, N. Ranganathan
RECOMB
2003
Springer
16 years 7 months ago
Finding recurrent sources in sequences
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
Aristides Gionis, Heikki Mannila
190
Voted
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 7 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman