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

Ideals having the expected reduction number

by Bernd Ulrich, Bernd Ulrich - Amer. J. Math , 1996
"... k, and let I be an R-ideal. When studying algebraic properties of the blow-up of Spec(R) along V(I), it is often important to have good upper bounds for the “reduction number ” of the ideal I. Recall that an ideal J I is a reduction of I if the extension of Rees algebras R[Jt] R[It] is module fin ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
k, and let I be an R-ideal. When studying algebraic properties of the blow-up of Spec(R) along V(I), it is often important to have good upper bounds for the “reduction number ” of the ideal I. Recall that an ideal J I is a reduction of I if the extension of Rees algebras R[Jt] R[It] is module

Attention and the detection of signals

by Michael I. Posner, Charles R. R. Snyder, Brian J. Davidson - Journal of Experimental Psychology: General , 1980
"... Detection of a visual signal requires information to reach a system capable of eliciting arbitrary responses required by the experimenter. Detection latencies are reduced when subjects receive a cue that indicates where in the visual field the signal will occur. This shift in efficiency appears to b ..."
Abstract - Cited by 565 (2 self) - Add to MetaCart
per-formance, information on the form of the stimulus does not. Third, expectancy may lead to improvements in latency without a reduction in accuracy. Fourth, there appears to be little ability to lower the criterion at two positions that are

Self-efficacy: Toward a unifying theory of behavioral change

by Albert Bandura - Psychological Review , 1977
"... The present article presents an integrative theoretical framework to explain and to predict psychological changes achieved by different modes of treatment. This theory states that psychological procedures, whatever their form, alter the level and strength of self-efficacy. It is hypothesized that ex ..."
Abstract - Cited by 3697 (4 self) - Add to MetaCart
experiences of mastery, further enhancement of self-efficacy and corresponding reductions in defensive behavior. In the proposed model, expectations of personal efficacy are derived from four principal sources of information: performance accomplishments, vicarious experience, verbal persuasion

Toward Optimal Active Learning through Sampling Estimation of Error Reduction

by Nicholas Roy, Andrew Mccallum - In Proc. 18th International Conf. on Machine Learning , 2001
"... This paper presents an active learning method that directly optimizes expected future error. This is in contrast to many other popular techniques that instead aim to reduce version space size. These other methods are popular because for many learning models, closed form calculation of the expec ..."
Abstract - Cited by 353 (2 self) - Add to MetaCart
of the expected future error is intractable. Our approach is made feasible by taking a sampling approach to estimating the expected reduction in error due to the labeling of a query. In experimental results on two real-world data sets we reach high accuracy very quickly, sometimes with four times fewer

The Performance of Query Control Schemes for the Zone Routing Protocol

by Zygmunt J. Haas, Senior Member, Marc R. Pearlman , 2001
"... In this paper, we study the performance of route query control mechanisms for the Zone Routing Protocol (ZRP) for ad hoc networks. ZRP proactively maintains routing information for a local neighborhood (routing zone), while reactively acquiring routes to destinations beyond the routing zone. This hy ..."
Abstract - Cited by 325 (15 self) - Add to MetaCart
. This hybrid routing approach can be more efficient than traditional routing schemes. However, without proper query control techniques, the ZRP cannot provide the expected reduction in the control traffic.

Discriminant adaptive nearest neighbor classification,

by Rrrevor Hastie , Robert Tibshirani , 1995
"... Abstract Nearest neighbor classification expects the class conditional probabilities to be locally constant, and suffers from bias in high dimensions We propose a locally adaptive form of nearest neighbor classification to try to finesse this curse of dimensionality. We use a local linear discrimin ..."
Abstract - Cited by 321 (1 self) - Add to MetaCart
Abstract Nearest neighbor classification expects the class conditional probabilities to be locally constant, and suffers from bias in high dimensions We propose a locally adaptive form of nearest neighbor classification to try to finesse this curse of dimensionality. We use a local linear

Serum PCSK9 Levels Distinguish Individuals Who Do Not Respond to High-Dose Statin Therapy with the Expected Reduction in LDL-C

by Beth A Taylor , Gregory Panza , Linda S Pescatello , Stuart Chipkin , Daniel Gipe , Weiping Shao , C Michael White , Paul D Thompson
"... The purpose of the present report was to examine whether proprotein convertase subtilisin/kexin type 9 (PCSK9) levels differ in individuals who do not exhibit expected reductions in low density lipoprotein cholesterol (LDL-C) with statin therapy. Eighteen nonresponder subjects treated with 80 mg at ..."
Abstract - Add to MetaCart
The purpose of the present report was to examine whether proprotein convertase subtilisin/kexin type 9 (PCSK9) levels differ in individuals who do not exhibit expected reductions in low density lipoprotein cholesterol (LDL-C) with statin therapy. Eighteen nonresponder subjects treated with 80 mg

The EM Algorithm for Mixtures of Factor Analyzers

by Zoubin Ghahramani, Geoffrey E. Hinton , 1997
"... Factor analysis, a statistical method for modeling the covariance structure of high dimensional data using a small number of latent variables, can be extended by allowing different local factor models in different regions of the input space. This results in a model which concurrently performs cluste ..."
Abstract - Cited by 278 (18 self) - Add to MetaCart
clustering and dimensionality reduction, and can be thought of as a reduced dimension mixture of Gaussians. We present an exact Expectation--Maximization algorithm for fitting the parameters of this mixture of factor analyzers. 1 Introduction Clustering and dimensionality reduction have long been considered

A Fine is a Price.”

by Uri Gneezy , Aldo Rustichini - Journal of Legal Studies , 2000
"... Abstract The deterrence hypothesis predicts that the introduction of a penalty that leaves everything else unchanged will reduce the occurrence of the behavior subject to the fine. We present the result of a field study in a group of day-care centers that contradicts this prediction. Parents used t ..."
Abstract - Cited by 249 (9 self) - Add to MetaCart
to arrive late to collect their children, forcing a teacher to stay after closing time. We introduced a monetary fine for late-coming parents. As a result, the number of late-coming parents increased significantly. After the fine was removed no reduction occurred. We argue that penalties are usually

Disclosure, liquidity, and the cost of capital

by Douglas W. Diamond, Robert E. Verrecchia - Journal of Finance , 1991
"... This paper shows that revealing public information to reduce information asymme-try can reduce a firm's cost of capital by attracting increased demand from large investors due to increased liquidity of its securities. Large firms will disclose more information since they benefit most. Disclosur ..."
Abstract - Cited by 251 (8 self) - Add to MetaCart
. Disclosure also reduces the risk bearing capacity available through market makers. If initial information asymmetry is large, reducing it will increase the current price of the security. However, the maximum current price occurs with some asymmetry of information: further reduc-tion of information asymmetry
Next 10 →
Results 1 - 10 of 7,394
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