Results 1  10
of
5,959
Symbolic Boolean manipulation with ordered binarydecision diagrams
 ACM COMPUTING SURVEYS
, 1992
"... Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as grap ..."
Abstract

Cited by 1036 (13 self)
 Add to MetaCart
Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented
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
The empirical case for two systems of reasoning
, 1996
"... Distinctions have been proposed between systems of reasoning for centuries. This article distills properties shared by many of these distinctions and characterizes the resulting systems in light of recent findings and theoretical developments. One system is associative because its computations ref ..."
Abstract

Cited by 669 (4 self)
 Add to MetaCart
reflect similarity structure and relations of temporal contiguity. The other is “rule based” because it operates on symbolic structures that have logical content and variables and because its computations have the properties that are normally assigned to rules. The systems serve complementary functions
An integrated theory of the mind
 PSYCHOLOGICAL REVIEW
, 2004
"... There has been a proliferation of proposed mental modules in an attempt to account for different cognitive functions but so far there has been no successful account of their integration. ACTR (Anderson & Lebiere, 1998) has evolved into a theory that consists of multiple modules but also explain ..."
Abstract

Cited by 780 (73 self)
 Add to MetaCart
where they can be detected by a production system that responds to patterns of information in the buffers. At any point in time a single production rule is selected to respond to the current pattern. Subsymbolic processes serve to guide the selection of rules to fire as well as the internal operations
Capacity of a Mobile MultipleAntenna Communication Link in Rayleigh Flat Fading
"... We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence int ..."
Abstract

Cited by 495 (22 self)
 Add to MetaCart
We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence
Crystallography & NMR system: A new software suite for macromolecular structure determination.
 Acta Crystallogr. D Biol. Crystallogr.
, 1998
"... Abstract A new software suite, called Crystallography & NMR System (CNS), has been developed for macromolecular structure determination by Xray crystallography or solution nuclear magnetic resonance (NMR) spectroscopy. In contrast to existing structure determination programs the architecture o ..."
Abstract

Cited by 1411 (6 self)
 Add to MetaCart
symbolic structure determination language (CNS language), and lowlevel source code. Each layer is accessible to the user. The novice user may just use the HTML interface, while the more advanced user may use any of the other layers. The source code will be distributed, thus source code modification
Automatic predicate abstraction of C programs
 IN PROC. ACM PLDI
, 2001
"... Model checking has been widely successful in validating and debugging designs in the hardware and protocol domains. However, statespace explosion limits the applicability of model checking tools, so model checkers typically operate on abstractions of systems. Recently, there has been significant in ..."
Abstract

Cited by 488 (33 self)
 Add to MetaCart
Model checking has been widely successful in validating and debugging designs in the hardware and protocol domains. However, statespace explosion limits the applicability of model checking tools, so model checkers typically operate on abstractions of systems. Recently, there has been significant
Binary operations
 Journal of Formalized Mathematics
, 1989
"... Summary. In this paper we define binary and unary operations on domains. We also define the following predicates concerning the operations:... is commutative,... is associative,... is the unity of..., and... is distributive wrt.... A number of schemes useful in justifying the existence of the operat ..."
Abstract

Cited by 363 (6 self)
 Add to MetaCart
Summary. In this paper we define binary and unary operations on domains. We also define the following predicates concerning the operations:... is commutative,... is associative,... is the unity of..., and... is distributive wrt.... A number of schemes useful in justifying the existence
How to calculate symbolically siphons and traps for some algebraic Petri nets
 IN PREPARATION
, 1996
"... We present a symbolic approach to the calculation of siphons and traps for algebraic Petri nets where the color domains are specified without equations and with at most unary operation symbols. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We present a symbolic approach to the calculation of siphons and traps for algebraic Petri nets where the color domains are specified without equations and with at most unary operation symbols.
Robust frequency and timing synchronization for OFDM
 IEEE Transactions on Communications
, 1997
"... Abstract — A rapid synchronization method is presented for an orthogonal frequencydivision multiplexing (OFDM) system using either a continuous transmission or a burst operation over a frequencyselective channel. The presence of a signal can be detected upon the receipt of just one training sequen ..."
Abstract

Cited by 386 (0 self)
 Add to MetaCart
sequence of two symbols. The start of the frame and the beginning of the symbol can be found, and carrier frequency offsets of many subchannels spacings can be corrected. The algorithms operate near the Cramér–Rao lower bound for the variance of the frequency offset estimate, and the inherent averaging
Results 1  10
of
5,959