79 search results - page 5 / 16 » Hypertree Decompositions: Structure, Algorithms, and Applica... |
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of no...
NIPS
2004
14 years 10 months ago
2004
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Re...
180
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
66
Voted
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
SLSFS
2005
Springer
15 years 2 months ago
2005
Springer
Abstract. Matrix factorization is a fundamental building block in many computer vision and machine learning algorithms. In this work we focus on the problem of ”structure from mo...