Sciweavers

16666 search results - page 2670 / 3334
» Descriptive and Computational Complexity
Sort
View
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
16 years 7 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
198
Voted
PKC
2009
Springer
116views Cryptology» more  PKC 2009»
16 years 7 months ago
Improving the Boneh-Franklin Traitor Tracing Scheme
Abstract. Traitor tracing schemes are cryptographically secure broadcast methods that allow identification of conspirators: if a pirate key is generated by k traitors out of a stat...
Pascal Junod, Alexandre Karlov, Arjen K. Lenstra
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 7 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
244
Voted
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 7 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 7 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
« Prev « First page 2670 / 3334 Last » Next »