1554 search results - page 46 / 311 » Parameterized Complexity and Approximation Algorithms |
81
Voted
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
The loss of information due to occlusion and other complications has been one of the main bottlenecks in the field of motion estimation. In this paper, we propose a novel motion e...
87
Voted
PODS
2008
ACM
15 years 10 months ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
ICMCS
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
IJSI
2010
14 years 8 months ago
2010
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
86
Voted
SIGPRO
2011
14 years 5 months ago
2011
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...