Results 1  10
of
2,207
Near Shannon limit errorcorrecting coding and decoding
, 1993
"... Abstract This paper deals with a new class of convolutional codes called Turbocodes, whose performances in terms of Bit Error Rate (BER) are close to the SHANNON limit. The TurboCode encoder is built using a parallel concatenation of two Recursive Systematic Convolutional codes and the associated ..."
Abstract

Cited by 1776 (6 self)
 Add to MetaCart
and the associated decoder, using a feedback decoding rule, is implemented as P pipelined identical elementary decoders. Consider a binary rate R=1/2 convolutional encoder with constraint length K and memory M=K1. The input to the encoder at time k is a bit dk and the corresponding codeword
Fast Monte Carlo Algorithms for Matrices II: Computing a LowRank Approximation to a Matrix
 SIAM JOURNAL ON COMPUTING
, 2004
"... ... matrix A. It is often of interest to find a lowrank approximation to A, i.e., an approximation D to the matrix A of rank not greater than a specified rank k, where k is much smaller than m and n. Methods such as the Singular Value Decomposition (SVD) may be used to find an approximation to A ..."
Abstract

Cited by 216 (20 self)
 Add to MetaCart
description of a lowrank approximation D to A, and which are qualitatively faster than the SVD. Both algorithms have provable bounds for the error matrix A D . For any matrix X , let kXk and kXk 2 denote its Frobenius norm and its spectral norm, respectively. In the rst algorithm, c = O(1
A dataclustering algorithm on distributed memory multiprocessors.
 In LargeScale Parallel Data Mining, Lecture Notes in Artificial Intelligence,
, 2000
"... Abstract. To cluster increasingly massive data sets that are common today in data and text mining, we propose a parallel implementation of the kmeans clustering algorithm based on the message passing model. The proposed algorithm exploits the inherent dataparallelism in the kmeans algorithm. We a ..."
Abstract

Cited by 135 (1 self)
 Add to MetaCart
Abstract. To cluster increasingly massive data sets that are common today in data and text mining, we propose a parallel implementation of the kmeans clustering algorithm based on the message passing model. The proposed algorithm exploits the inherent dataparallelism in the kmeans algorithm. We
Packet Classification using Tuple Space Search
 In Proc. of SIGCOMM
, 1999
"... Routers must perform packet classification at high speeds to efficiently implement functions such as rewalls and QoS routing. Packet classification requires matching each packet against a database of filters (or rules), and forwarding the packet according to the highest priority filter. Existing fil ..."
Abstract

Cited by 195 (7 self)
 Add to MetaCart
had a tuple space of 41 which our algorithm prunes to 11 tuples. Even as we increased the filter database size from 1K to 100K (using a random twodimensional filter generation model), the number of tuples grew from 53 to only 186, and the pruned tuples only grew from 1 to 4. Our Pruned Tuple Space
Frequency estimation of internet packet streams with limited space
 IN PROCEEDINGS OF THE 10TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS
, 2002
"... We consider a router on the Internet analyzing the statistical properties of a TCP/IP packet stream. A fundamental difficulty with measuring traffic behavior on the Internet is that there is simply too much data to be recorded for later analysis, on the order of gigabytes a second. As a result, net ..."
Abstract

Cited by 168 (1 self)
 Add to MetaCart
, network routers can collect only relatively few statistics about the data. The central problem addressed here is to use the limited memory of routers to determine essential features of the network traffic stream. A particularly difficult and representative subproblem is to determine the top k categories
A Tradeoff between Space and Efficiency for Routing Tables
, 1989
"... Two conflicting goals play a crucial role in the design of routing schemes for communication networks. A routing scheme should use paths that are as short as possible for routing messages in the network, while keeping the routing information stored in the processors’ local memory as succinct as pos ..."
Abstract

Cited by 157 (7 self)
 Add to MetaCart
upper and lower bounds for this tradeoff are presented. Specifically, it is proved that any routing scheme for general nvertex networks that achieves a stretch factor k 2 1 must use a total of Q(n ‘+“fzLcJ)) bits of routing information in the networks. This lower bound is complemented by a family Z(k
How to Reuse a "WriteOnce" Memory
, 1982
"... Storage media such as digital optical disks, PROMS, or paper tape consist of a number of "writeonce " bit positions (wigs); each wit initially contains a "0 " that may later be irreversibly overwritten with a "1". We demonstrate that such "writeonce memories &quo ..."
Abstract

Cited by 87 (0 self)
 Add to MetaCart
Storage media such as digital optical disks, PROMS, or paper tape consist of a number of "writeonce " bit positions (wigs); each wit initially contains a "0 " that may later be irreversibly overwritten with a "1". We demonstrate that such "writeonce memories
Algebraic attacks on combiners with memory
 ADVANCES IN CRYPTOLOGY  CRYPTO 2003, LNCS 2729
, 2003
"... Recently, algebraic attacks were proposed to attack several cryptosystems, e.g. AES, LILI128 and Toyocrypt. This paper extends the use of algebraic attacks to combiners with memory. A (k, l)combiner consists of k parallel linear feedback shift registers (LFSRs), and the nonlinear filtering is don ..."
Abstract

Cited by 56 (6 self)
 Add to MetaCart
is done via a finite automaton with k input bits and l memory bits. It is shown that for (k, l)combiners, nontrivial canceling relations of degree at most ⌈k(l+1)/2 ⌉ exist. This makes algebraic attacks possible. Also, a general method is presented to check for such relations with an even lower degree
cdec: A decoder, alignment, and learning framework for finitestate and contextfree translation models
 In Proceedings of ACL System Demonstrations
, 2010
"... We present cdec, an open source framework for decoding, aligning with, and training a number of statistical machine translation models, including wordbased models, phrasebased models, and models based on synchronous contextfree grammars. Using a single unified internal representation for translat ..."
Abstract

Cited by 134 (53 self)
 Add to MetaCart
for translation forests, the decoder strictly separates modelspecific translation logic from general rescoring, pruning, and inference algorithms. From this unified representation, the decoder can extract not only the 1 or kbest translations, but also alignments to a reference, or the quantities necessary
Implementing signatures for transactional memory
 40th Intl. Symp. on Microarchitecture
, 2007
"... Transactional Memory (TM) systems must track the read and write sets—items read and written during a transaction—to detect conflicts among concurrent transactions. Several TMs use signatures, which summarize unbounded read/write sets in bounded hardware at a performance cost of false positives (conf ..."
Abstract

Cited by 49 (7 self)
 Add to MetaCart
Transactional Memory (TM) systems must track the read and write sets—items read and written during a transaction—to detect conflicts among concurrent transactions. Several TMs use signatures, which summarize unbounded read/write sets in bounded hardware at a performance cost of false positives
Results 1  10
of
2,207