Sciweavers

87 search results - page 8 / 18
» Using hashing to solve the dictionary problem
Sort
View
JMLR
2010
155views more  JMLR 2010»
13 years 2 months ago
Structured Sparse Principal Component Analysis
We present an extension of sparse PCA, or sparse dictionary learning, where the sparsity patterns of all dictionary elements are structured and constrained to belong to a prespeci...
Rodolphe Jenatton, Guillaume Obozinski, Francis Ba...
CIKM
1998
Springer
13 years 12 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
CG
1998
Springer
13 years 12 months ago
A Survey of Tsume-Shogi Programs Using Variable-Depth Search
Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Public...
Reijer Grimbergen
ICASSP
2009
IEEE
14 years 2 months ago
Rate-constrained distributed distance testing and its applications
We investigate a practical approach to solving one instantiation of a distributed hypothesis testing problem under severe rate constraints that shows up in a wide variety of appli...
Chuohao Yeo, Parvez Ahammad, Hao Zhang, Kannan Ram...
PKC
2000
Springer
166views Cryptology» more  PKC 2000»
13 years 11 months ago
Design Validations for Discrete Logarithm Based Signature Schemes
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
Ernest F. Brickell, David Pointcheval, Serge Vaude...