Sciweavers

8669 search results - page 26 / 1734
» Computing matrix representations
Sort
View
AVI
2008
15 years 25 days ago
Visualizing program similarity in the Ac plagiarism detection system
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...
Manuel Freire
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
15 years 5 months ago
A Proof for the Approximate Sparsity of SLAM Information Matrices
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
Udo Frese
DAC
2000
ACM
16 years 21 days ago
Fast methods for extraction and sparsification of substrate coupling
The sudden increase in systems-on-a-chip designs has renewed interest in techniques for analyzing and eliminating substrate coupling problems. Previous work on the substrate coupl...
Joe Kanapka, Joel R. Phillips, Jacob White
CVPR
2004
IEEE
16 years 1 months ago
Joint Feature-Basis Subset Selection
We treat feature selection and basis selection in a unified framework by introducing the masking matrix. If one considers feature selection as finding a binary mask vector that de...
Shai Avidan
CORR
2004
Springer
152views Education» more  CORR 2004»
14 years 11 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer