• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 493,910
Next 10 →

Iterative decoding of binary block and convolutional codes

by Joachim Hagenauer, Elke Offer, Lutz Papke - IEEE Trans. Inform. Theory , 1996
"... Abstract- Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms: the ..."
Abstract - Cited by 600 (43 self) - Add to MetaCart
: the soft channel and a priori inputs, and the extrinsic value. The extrinsic value is used as an a priori value for the next iteration. Decoding algorithms in the log-likelihood domain are given not only for convolutional codes hut also for any linear binary systematic block code. The iteration

The Lifting Scheme: A Construction Of Second Generation Wavelets

by Wim Sweldens , 1997
"... . We present the lifting scheme, a simple construction of second generation wavelets, wavelets that are not necessarily translates and dilates of one fixed function. Such wavelets can be adapted to intervals, domains, surfaces, weights, and irregular samples. We show how the lifting scheme leads to ..."
Abstract - Cited by 541 (16 self) - Add to MetaCart
. We present the lifting scheme, a simple construction of second generation wavelets, wavelets that are not necessarily translates and dilates of one fixed function. Such wavelets can be adapted to intervals, domains, surfaces, weights, and irregular samples. We show how the lifting scheme leads

CONSTRUCTIONS FOR CYCLIC STEINER 2-DESIGNS

by unknown authors
"... This paper surveys direct and recursive constructions for cyclic Steiner 2-designs. A new method is presented for cyclic designs with blocks having a prime number of elements. Several new constructions are given for designs with block size 4 which are based on perfect systems of difference sets and ..."
Abstract - Add to MetaCart
This paper surveys direct and recursive constructions for cyclic Steiner 2-designs. A new method is presented for cyclic designs with blocks having a prime number of elements. Several new constructions are given for designs with block size 4 which are based on perfect systems of difference sets

Toward a model of text comprehension and production

by Walter Kintsch, Teun A. Van Dijk - Psychological Review , 1978
"... The semantic structure of texts can be described both at the local microlevel and at a more global macrolevel. A model for text comprehension based on this notion accounts for the formation of a coherent semantic text base in terms of a cyclical process constrained by limitations of working memory. ..."
Abstract - Cited by 540 (12 self) - Add to MetaCart
are predictable only when the control schema can be made explicit. On the production side, the model is con-cerned with the generation of recall and summarization protocols. This process is partly reproductive and partly constructive, involving the inverse operation of the macro-operators. The model is applied

On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks

by Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Ephremides , 2000
"... wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil ..."
Abstract - Cited by 554 (13 self) - Add to MetaCart
wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil

The Esterel Synchronous Programming Language: Design, Semantics, Implementation

by Gerard Berry, Georges Gonthier , 1992
"... ..."
Abstract - Cited by 813 (10 self) - Add to MetaCart
Abstract not found

Factor Graphs and the Sum-Product Algorithm

by Frank R. Kschischang, Brendan J. Frey, Hans-Andrea Loeliger - IEEE TRANSACTIONS ON INFORMATION THEORY , 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract - Cited by 1787 (72 self) - Add to MetaCart
A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple

Design and Evaluation of a Wide-Area Event Notification Service

by Antonio Carzaniga, David S. Rosenblum, Alexander L. Wolf - ACM Transactions on Computer Systems
"... This paper presents SIENA, an event notification service that we have designed and implemented to exhibit both expressiveness and scalability. We describe the service's interface to applications, the algorithms used by networks of servers to select and deliver event notifications, and the strat ..."
Abstract - Cited by 789 (32 self) - Add to MetaCart
This paper presents SIENA, an event notification service that we have designed and implemented to exhibit both expressiveness and scalability. We describe the service's interface to applications, the algorithms used by networks of servers to select and deliver event notifications

K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation

by Michal Aharon, et al. , 2006
"... In recent years there has been a growing interest in the study of sparse representation of signals. Using an overcomplete dictionary that contains prototype signal-atoms, signals are described by sparse linear combinations of these atoms. Applications that use sparse representation are many and inc ..."
Abstract - Cited by 930 (41 self) - Add to MetaCart
and include compression, regularization in inverse problems, feature extraction, and more. Recent activity in this field has concentrated mainly on the study of pursuit algorithms that decompose signals with respect to a given dictionary. Designing dictionaries to better fit the above model can be done

Estimating Production Functions Using Inputs to Control for Unobservables

by James Levinsohn, Amil Petrin , 2000
"... ..."
Abstract - Cited by 835 (11 self) - Add to MetaCart
Abstract not found
Next 10 →
Results 1 - 10 of 493,910
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University