Results 1  10
of
2,743
Raptor codes
 IEEE Transactions on Information Theory
, 2006
"... LTCodes are a new class of codes introduced in [1] for the purpose of scalable and faulttolerant distribution of data over computer networks. In this paper we introduce Raptor Codes, an extension of LTCodes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: ..."
Abstract

Cited by 577 (7 self)
 Add to MetaCart
: for a given integer k, and any real ε> 0, Raptor codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1 + ε) is sufficient to recover the original k symbols with high probability. Each output symbol is generated using O(log(1/ε)) operations
Learning Accurate, Compact, and Interpretable Tree Annotation
 In ACL ’06
, 2006
"... We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting with a simple Xbar grammar, we learn a new grammar whose nonterminals are subsymbols of the original nonterminals. In co ..."
Abstract

Cited by 423 (42 self)
 Add to MetaCart
We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting with a simple Xbar grammar, we learn a new grammar whose nonterminals are subsymbols of the original nonterminals
Verification of synchronous sequential machines based on symbolic execution
, 1989
"... This paper presents an original method to compare two synchronous sequential machines. The method consists in a breadth first traversal of the product machine during which symbolic expressions of its observable behaviour are computed. The method uses formal manipulations on boolean functions to avoi ..."
Abstract

Cited by 175 (3 self)
 Add to MetaCart
This paper presents an original method to compare two synchronous sequential machines. The method consists in a breadth first traversal of the product machine during which symbolic expressions of its observable behaviour are computed. The method uses formal manipulations on boolean functions
Informed Content Delivery Across Adaptive Overlay Networks
, 2002
"... Overlay networks have emerged as a powerful and highly flexible method for delivering content. We study how to optimize throughput of large, multipoint transfers across richly connected overlay networks, focusing on the question of what to put in each transmitted packet. We first make the case for ..."
Abstract

Cited by 247 (8 self)
 Add to MetaCart
for transmitting encoded content in this scenario, arguing for the digital fountain approach which enables endhosts to efficiently restitute the original content of size n from a subset of any n symbols from a large universe of encoded symbols. Such an approach affords reliability and a substantial de
Symbol grounding and the origin of language
 Computationalism: New Directions
, 2002
"... ABSTRACT: What language allows us to do is to "steal" categories quickly and effortlessly through hearsay instead of having to earn them the hard way, through risky and timeconsuming sensorimotor "toil" (trialanderror learning, guided by corrective feedback from the consequen ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
the consequences of miscategorisation). To make such linguistic "theft" possible, however, some, at least, of the denoting symbols of language must first be grounded in categories that have been earned through sensorimotor toil (or else in categories that have already been "prepared" for us
Identifying hierarchical structure in sequences: A lineartime algorithm
, 1997
"... SEQUITUR is an algorithm that infers a hierarchical structure from a sequence of discrete symbols by replacing repeated phrases with a grammatical rule that generates the phrase, and continuing this process recursively. The result is a hierarchical representation of the original sequence, which offe ..."
Abstract

Cited by 202 (4 self)
 Add to MetaCart
SEQUITUR is an algorithm that infers a hierarchical structure from a sequence of discrete symbols by replacing repeated phrases with a grammatical rule that generates the phrase, and continuing this process recursively. The result is a hierarchical representation of the original sequence, which
A physical Approach to Color Image Understanding
, 1990
"... In this paper, we present an approach to color image understanding that can be used to segment and analyze sur faces with color variations due to highlights and shading. The work is based on a theorythe Dichromatic Reflec tion Modelwhich describes the color of the reflected light as a mixture ..."
Abstract

Cited by 211 (10 self)
 Add to MetaCart
of light from surface reflection (highlights) and body reflection (object color). In the past, we have shown how the dichromatic theory can be used to separate a color image into two intrinsic reflection images: an image of just the highlights, and the original image with the highlights removed
Experiencing SAX: a Novel Symbolic Representation of Time Series
, 2007
"... Many high level representations of time series have been proposed for data mining, including Fourier transforms, wavelets, eigenwaves, piecewise polynomial models etc. Many researchers have also considered symbolic representations of time series, noting that such representations would potentiality ..."
Abstract

Cited by 124 (18 self)
 Add to MetaCart
of the symbolic representation is the same as the original data, and virtually all data mining algorithms scale poorly with dimensionality. Secondly, although distance measures can be defined on the symbolic approaches, these distance measures have little correlation with distance measures defined on the original
On the Nature and Origin of Algebraic Symbolism
"... Ever since Nesselmann’s study on “Greek algebra ” (1842), historical accounts on algebra draw a distinction in rhetorical, syncopated and symbolic algebra. This tripartite distinction has become such a commonplace depiction of the history of algebraic symbolism that modernday authors even fail to ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Ever since Nesselmann’s study on “Greek algebra ” (1842), historical accounts on algebra draw a distinction in rhetorical, syncopated and symbolic algebra. This tripartite distinction has become such a commonplace depiction of the history of algebraic symbolism that modernday authors even fail
The Origins of Syntax in Visually Grounded Robotic Agents
, 1997
"... The paper proposes a set of principles and a general architecture that may explain how language and meaning may originate and complexify in a group of physically grounded distributed agents. An experimental setup is introduced for concretising and validating specific mechanisms based on these princi ..."
Abstract

Cited by 127 (25 self)
 Add to MetaCart
has made remarkable progress the last decades by showing how operations over symbolic models may explain various aspects of intelligent behavior, such as planning, problem solving, natural language processing, etc. However, the problem of the origin of these symbolic models has so far not been
Results 1  10
of
2,743