• 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 130,059
Next 10 →

Good News and Bad News: Representation Theorems and Applications

by Paul R. Milgrom - Bell Journal of Economics
"... prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtai ..."
Abstract - Cited by 700 (3 self) - Add to MetaCart
prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may

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
education? Many campuses around the country are asking this question. To provide a focus for their work, we offer seven principles based on research on good teaching and learning in colleges and universities. Good practice in undergraduate education: 1. Encourages contacts between students and faculty. 2

Greed is Good: Algorithmic Results for Sparse Approximation

by Joel A. Tropp , 2004
"... This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries. It provides a sufficient condition under which both OMP and Donoho’s basis pursuit (BP) paradigm can recover the optimal representa ..."
Abstract - Cited by 916 (9 self) - Add to MetaCart
This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries. It provides a sufficient condition under which both OMP and Donoho’s basis pursuit (BP) paradigm can recover the optimal

Lag length selection and the construction of unit root tests with good size and power

by Serena Ng, Pierre Perron - Econometrica , 2001
"... It is widely known that when there are errors with a moving-average root close to −1, a high order augmented autoregression is necessary for unit root tests to have good size, but that information criteria such as the AIC and the BIC tend to select a truncation lag (k) that is very small. We conside ..."
Abstract - Cited by 558 (14 self) - Add to MetaCart
It is widely known that when there are errors with a moving-average root close to −1, a high order augmented autoregression is necessary for unit root tests to have good size, but that information criteria such as the AIC and the BIC tend to select a truncation lag (k) that is very small. We

What good are positive emotions

by Barbara L. Fredrickson - Review of General Psychology , 1998
"... This article opens by noting that positive emotions do not fit existing models of emotions. Consequently, a new model is advanced to describe the form and function of a subset of positive emotions, including joy, interest, contentment, and love. This new model posits that these positive emotions ser ..."
Abstract - Cited by 454 (15 self) - Add to MetaCart
;quot;What good are positive emotions?" have yet to be articulated. This is unfortunate. being, and physical health. Experiences of positive emotion are central to Why Have Positive Emotions human nature and contribute richly to the quality of people's lives (Diener & Larsen, Been Marginalized

Quantization Index Modulation: A Class of Provably Good Methods for Digital Watermarking and Information Embedding

by Brian Chen, Gregory W. Wornell - IEEE TRANS. ON INFORMATION THEORY , 1999
"... We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing information-embedding rate, mini ..."
Abstract - Cited by 496 (14 self) - Add to MetaCart
refer to as dither modulation. Using deterministic models to evaluate digital watermarking methods, we show that QIM is "provably good" against arbitrary bounded and fully informed attacks, which arise in several copyright applications, and in particular, it achieves provably better rate

Large Margin Classification Using the Perceptron Algorithm

by Yoav Freund, Robert E. Schapire - Machine Learning , 1998
"... We introduce and analyze a new algorithm for linear classification which combines Rosenblatt 's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like Vapnik 's maximal-margin classifier, our algorithm takes advantage of data that are linearly separable with large ..."
Abstract - Cited by 521 (2 self) - Add to MetaCart
with large margins. Compared to Vapnik's algorithm, however, ours is much simpler to implement, and much more efficient in terms of computation time. We also show that our algorithm can be efficiently used in very high dimensional spaces using kernel functions. We performed some experiments using our

Optimizing Search Engines using Clickthrough Data

by Thorsten Joachims , 2002
"... This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous approaches ..."
Abstract - Cited by 1314 (23 self) - Add to MetaCart
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous

Text Classification using String Kernels

by Huma Lodhi, Craig Saunders, John Shawe-Taylor, Nello Cristianini, Chris Watkins
"... We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences of length k. A subsequence is any ordered sequence of k characters occurring in the text though not necessarily contiguo ..."
Abstract - Cited by 495 (7 self) - Add to MetaCart
We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences of length k. A subsequence is any ordered sequence of k characters occurring in the text though not necessarily

A combined corner and edge detector

by Chris Harris, Mike Stephens - In Proc. of Fourth Alvey Vision Conference , 1988
"... Consistency of image edge filtering is of prime importance for 3D interpretation of image sequences using feature tracking algorithms. To cater for image regions containing texture and isolated features, a combined corner and edge detector based on the local auto-correlation function is utilised, an ..."
Abstract - Cited by 2453 (2 self) - Add to MetaCart
Consistency of image edge filtering is of prime importance for 3D interpretation of image sequences using feature tracking algorithms. To cater for image regions containing texture and isolated features, a combined corner and edge detector based on the local auto-correlation function is utilised
Next 10 →
Results 1 - 10 of 130,059
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