Sciweavers

9209 search results - page 112 / 1842
» Data Space Randomization
Sort
View
WG
1993
Springer
15 years 8 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
SADM
2008
90views more  SADM 2008»
15 years 4 months ago
ORIGAMI: A Novel and Effective Approach for Mining Representative Orthogonal Graph Patterns
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...
Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, J&e...
ICASSP
2011
IEEE
14 years 8 months ago
An acoustically-motivated spatial prior for under-determined reverberant source separation
We consider the task of under-determined reverberant audio source separation. We model the contribution of each source to all mixture channels in the time-frequency domain as a ze...
Ngoc Q. K. Duong, Emmanuel Vincent, Rémi Gr...
NORDSEC
2009
Springer
15 years 11 months ago
Towards True Random Number Generation in Mobile Environments
In our paper, we analyze possibilities to generate true random data in mobile devices such as mobile phones or pocket computers. We show how to extract arguably true random data w...
Jan Bouda, Jan Krhovjak, Vashek Matyas, Petr Svend...
142
Voted
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
15 years 2 months ago
Efficient Nonnegative Matrix Factorization with Random Projections
The recent years have witnessed a surge of interests in Nonnegative Matrix Factorization (NMF) in data mining and machine learning fields. Despite its elegant theory and empirical...
Fei Wang, Ping Li