16 search results - page 3 / 4 » On Compact Representations of All-Pairs-Shortest-Path-Distan... |
AUSAI
2005
Springer
13 years 11 months ago
2005
Springer
All the traditional PCA-based and LDA-based methods are based on the analysis of vectors. So, it is difficult to evaluate the covariance matrices in such a high-dimensional vector ...
DCC
2011
IEEE
13 years 1 months ago
2011
IEEE
We present a new color image compression algorithm for RGB images. In our previous work [6], we presented a machine learning technique to derive a dictionary of orthonormal basis ...
CIKM
2007
Springer
14 years 10 days ago
2007
Springer
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
AVI
2008
13 years 7 months ago
2008
Programming assignments are easy to plagiarize in such a way as to foil casual reading by graders. Graders can resort to automatic plagiarism detection systems, which can generate...
ENTCS
2008
13 years 6 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...