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

CiteSeerX logo

Advanced Search Include Citations

Tools

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

How practical is network coding?

by Mea Wang, Baochun Li , 2006
"... With network coding, intermediate nodes between the source and the receivers of an end-to-end communication session are not only capable of relaying and replicating data messages, but also of coding incoming messages to produce coded outgoing ones. Recent studies have shown that network coding is ..."
Abstract - Cited by 1016 (23 self) - Add to MetaCart
With network coding, intermediate nodes between the source and the receivers of an end-to-end communication session are not only capable of relaying and replicating data messages, but also of coding incoming messages to produce coded outgoing ones. Recent studies have shown that network coding

Principles and Practice in Second Language Acquisition

by Stephen D Krashen , 1982
"... This is the original version of Principles and Practice, as published in 1982, with only minor changes. It is gratifying to point out that many of the predictions made in this book were confirmed by subsequent research, for example, the superiority of comprehensible-input based methods and sheltered ..."
Abstract - Cited by 775 (4 self) - Add to MetaCart
best through comprehensible input (Krashen, 1989; 2003). I have changed my position on only one issue: At the end of Principles and Practice, I suggest the use of a form of deception- students may think they are acquiring vocabulary or learning subject matter, but unknown to them, they are acquiring

Making Large-Scale SVM Learning Practical

by Thorsten Joachims , 1998
"... Training a support vector machine (SVM) leads to a quadratic optimization problem with bound constraints and one linear equality constraint. Despite the fact that this type of problem is well understood, there are many issues to be considered in designing an SVM learner. In particular, for large lea ..."
Abstract - Cited by 1861 (17 self) - Add to MetaCart
Training a support vector machine (SVM) leads to a quadratic optimization problem with bound constraints and one linear equality constraint. Despite the fact that this type of problem is well understood, there are many issues to be considered in designing an SVM learner. In particular, for large

Seven principles for good practice in undergraduate education

by W. Chickering, Zelda F. Gamson , 1987
"... Apathetic students, illiterate graduates, incompetent teaching, impersonal campuses-- so rolls the drumfire of criticism of higher education. More than two years of reports have spelled out the problems. States have been quick to respond by holding out carrots and beating with sticks. There are neit ..."
Abstract - Cited by 799 (0 self) - Add to MetaCart
, and they are-- because many teachers and students have experienced them and because research supports them. They rest on 50 years of research on the way teachers teach and students learn, how students work and play with one another, and how students and faculty talk to each other. While each practice can stand

Structural equation modeling in practice: a review and recommended two-step approach.

by James C Anderson , J L Kellogg , David W Gerbing , Jeanne Brett , Claes Fornell , David Larcker , William Perreault Jr , James Steiger - Psychological Bulletin, , 1988
"... In this article, we provide guidance for substantive researchers on the use of structural equation modeling in practice for theory testing and development. We present a comprehensive, two-step modeling approach that employs a series of nested models and sequential chi-square difference tests. We di ..."
Abstract - Cited by 1825 (3 self) - Add to MetaCart
In this article, we provide guidance for substantive researchers on the use of structural equation modeling in practice for theory testing and development. We present a comprehensive, two-step modeling approach that employs a series of nested models and sequential chi-square difference tests. We

Random Oracles are Practical: A Paradigm for Designing Efficient Protocols

by Mihir Bellare, Phillip Rogaway , 1995
"... We argue that the random oracle model -- where all parties have access to a public random oracle -- provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract - Cited by 1646 (70 self) - Add to MetaCart
We argue that the random oracle model -- where all parties have access to a public random oracle -- provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R

Making Large-Scale Support Vector Machine Learning Practical

by Thorsten Joachims , 1998
"... Training a support vector machine (SVM) leads to a quadratic optimization problem with bound constraints and one linear equality constraint. Despite the fact that this type of problem is well understood, there are many issues to be considered in designing an SVM learner. In particular, for large lea ..."
Abstract - Cited by 628 (1 self) - Add to MetaCart
Training a support vector machine (SVM) leads to a quadratic optimization problem with bound constraints and one linear equality constraint. Despite the fact that this type of problem is well understood, there are many issues to be considered in designing an SVM learner. In particular, for large

A theory of type polymorphism in programming

by Robin Milner - Journal of Computer and System Sciences , 1978
"... The aim of this work is largely a practical one. A widely employed style of programming, particularly in structure-processing languages which impose no discipline of types, entails defining procedures which work well on objects of a wide variety. We present a formal type discipline for such polymorp ..."
Abstract - Cited by 1076 (1 self) - Add to MetaCart
The aim of this work is largely a practical one. A widely employed style of programming, particularly in structure-processing languages which impose no discipline of types, entails defining procedures which work well on objects of a wide variety. We present a formal type discipline

Theory and Practice of Constraint Handling Rules

by Thom Frühwirth , 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-defined constraints. CHR are essentially a committed-choice language consisting of mu ..."
Abstract - Cited by 455 (37 self) - Add to MetaCart
of multi-headed guarded rules that rewrite constraints into simpler ones until they are solved. In this broad survey we aim at covering all aspects of CHR as they currently present themselves. Going from theory to practice, we will define syntax and semantics for CHR, introduce an important decidable

The dining cryptographers problem: Unconditional sender and recipient untraceability

by David Chaum - Journal of Cryptology , 1988
"... Abstract. Keeping confidential who sends which messages, in a world where any physical transmission can be traced to its origin, seems impossible. The solu-tion presented here is unconditionally or cryptographically secure, depending on whether it is based on one-time-use keys or on public keys, res ..."
Abstract - Cited by 577 (2 self) - Add to MetaCart
Abstract. Keeping confidential who sends which messages, in a world where any physical transmission can be traced to its origin, seems impossible. The solu-tion presented here is unconditionally or cryptographically secure, depending on whether it is based on one-time-use keys or on public keys
Next 10 →
Results 1 - 10 of 74,988
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