Sciweavers

108 search results - page 18 / 22
» A Sparse Coding Based Similarity Measure
Sort
View
TIT
2010
128views Education» more  TIT 2010»
14 years 4 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh
ICPR
2000
IEEE
15 years 1 months ago
Acoustic and Facial Features for Speaker Recognition
This paper gives an insight into biometrics used for speaker recognition. Three different biometrics are presented, based on: acoustic, geometric lip, and holistic facial features...
Matthew Roach, Jason Brand, John S. Mason
ISCIS
2005
Springer
15 years 3 months ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
100
Voted
AAAI
2010
14 years 11 months ago
Efficient Spectral Feature Selection with Minimum Redundancy
Spectral feature selection identifies relevant features by measuring their capability of preserving sample similarity. It provides a powerful framework for both supervised and uns...
Zheng Zhao, Lei Wang, Huan Liu
WWW
2008
ACM
15 years 10 months ago
Statistical properties of community structure in large social and information networks
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Mi...