• 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 11 - 20 of 21,793
Next 10 →

Overview of the Face Recognition Grand Challenge

by P. Jonathon Phillips, Patrick J. Flynn, Todd Scruggs, Kevin W. Bowyer, Jin Chang, Kevin Hoffman, Joe Marques, Jaesik Min, William Worek - In IEEE CVPR , 2005
"... Over the last couple of years, face recognition researchers have been developing new techniques. These developments are being fueled by advances in computer vision techniques, computer design, sensor design, and interest in fielding face recognition systems. Such advances hold the promise of reducin ..."
Abstract - Cited by 461 (32 self) - Add to MetaCart
Over the last couple of years, face recognition researchers have been developing new techniques. These developments are being fueled by advances in computer vision techniques, computer design, sensor design, and interest in fielding face recognition systems. Such advances hold the promise

Reconsidering research on learning from media.

by Richard E Clark - Review of Educational Research, , 1983
"... ABSTRACT. Recent meta-analyses and other studies of media influence on learning are reviewed. Consistent evidence is found for the generalization that there are no learning benefits to be gained from employing any specific medium to deliver instruction. Research showing performance or time-saving g ..."
Abstract - Cited by 462 (6 self) - Add to MetaCart
ABSTRACT. Recent meta-analyses and other studies of media influence on learning are reviewed. Consistent evidence is found for the generalization that there are no learning benefits to be gained from employing any specific medium to deliver instruction. Research showing performance or time

Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

by Steven Minton, Mark D. Johnston, Andrew B. Philips, Philip Laird - ARTIF. INTELL , 1992
"... This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-orderin ..."
Abstract - Cited by 457 (6 self) - Add to MetaCart
-ordering heuristic, the min-conflicts heuristic, that attempts to minimize the number of constraint violations after each step. The heuristic can be used with a variety of different search strategies. We demonstrate empirically that on the n-queens problem, a technique based on this approach performs orders

Security-control methods for statistical databases: a comparative study

by Nabil R. Adam, John C. Wortmann - ACM Computing Surveys , 1989
"... This paper considers the problem of providing security to statistical databases against disclosure of confidential information. Security-control methods suggested in the literature are classified into four general approaches: conceptual, query restriction, data perturbation, and output perturbation. ..."
Abstract - Cited by 416 (0 self) - Add to MetaCart
. Criteria for evaluating the performance of the various security-control methods are identified. Security-control methods that are based on each of the four approaches are discussed, together with their performance with respect to the identified evaluation criteria. A detailed comparative analysis

FAST TCP: Motivation, Architecture, Algorithms, Performance

by C. Jin, D. X. Wei, S. H. Low , 2004
"... We describe FAST TCP, a new TCP congestion control algorithm for high-speed long-latency networks, from design to implementation. We highlight the approach taken by FAST TCP to address the four difficulties, at both packet and flow levels, which the current TCP implementation has at large windows. W ..."
Abstract - Cited by 369 (18 self) - Add to MetaCart
high-speed long-latency networks into steady, efficient and fair operating points, in dynamic sharing environments, and the preliminary results are promising.

A comparative study of energy minimization methods for Markov random fields

by Richard Szeliski, Ramin Zabih, Daniel Scharstein, Olga Veksler, Aseem Agarwala, Carsten Rother, et al. - IN ECCV , 2006
"... One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with some quantity such as depth or texture. While many such problems can be elegantly expressed in the language of Markov Ran ..."
Abstract - Cited by 415 (36 self) - Add to MetaCart
Random Fields (MRF’s), the resulting energy minimization problems were widely viewed as intractable. Recently, algorithms such as graph cuts and loopy belief propagation (LBP) have proven to be very powerful: for example, such methods form the basis for almost all the top-performing stereo methods

The Determinants of Credit Spread Changes.

by Pierre Collin-Dufresne , Robert S Goldstein , J Spencer Martin , Gurdip Bakshi , Greg Bauer , Dave Brown , Francesca Carrieri , Peter Christoffersen , Susan Christoffersen , Greg Duffee , Darrell Duffie , Vihang Errunza , Gifford Fong , Mike Gallmeyer , Laurent Gauthier , Rick Green , John Griffin , Jean Helwege , Kris Jacobs , Chris Jones , Andrew Karolyi , Dilip Madan , David Mauer , Erwan Morellec , Federico Nardari , N R Prabhala , Tony Sanders , Sergei Sarkissian , Bill Schwert , Ken Singleton , Chester Spatt , René Stulz - Journal of Finance , 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract - Cited by 422 (2 self) - Add to MetaCart
changes. Below, we investigate the determinants of credit spread changes. From a contingent-claims, or noarbitrage standpoint, credit spreads obtain for two fundamental reasons: 1) there is a risk of default, and 2) in the event of default, the bondholder receives only a portion of the promised payments

Pay without performance: The unfulfilled promise of executive compensation.

by Lucian Arye Bebchuk , Jesse M Fried , Lucian Bebchuk , Jesse Fried , 2004
"... ). The book provides a detailed account of how structural flaws in corporate governance have enabled managers to influence their own pay and have produced widespread distortions in pay arrangements. The book also examines how these flaws and distortions can best be addressed. Part IV of the book di ..."
Abstract - Cited by 233 (6 self) - Add to MetaCart
). The book provides a detailed account of how structural flaws in corporate governance have enabled managers to influence their own pay and have produced widespread distortions in pay arrangements. The book also examines how these flaws and distortions can best be addressed. Part IV of the book discusses how executive compensation -and corporate governance more generally -can be improved. We examine the extent to which pay arrangements can be improved by adopting board process rules, imposing shareholder approval requirements, and making pay more transparent. We conclude that problems with compensation arrangements cannot be fully addressed without ensuring that directors focus on shareholder interests and operate at arm's length from the executives whose compensation they set. To achieve this result, we argue, it is not sufficient to make directors independent of executives as recent reforms has sought to do; it is also necessary to make directors dependent on shareholders by changing the legal arrangements that insulate boards from shareholders.

Markov chain monte carlo convergence diagnostics

by Kathryn Cowles, Bradley P. Carlin - JASA , 1996
"... A critical issue for users of Markov Chain Monte Carlo (MCMC) methods in applications is how to determine when it is safe to stop sampling and use the samples to estimate characteristics of the distribution of interest. Research into methods of computing theoretical convergence bounds holds promise ..."
Abstract - Cited by 371 (6 self) - Add to MetaCart
A critical issue for users of Markov Chain Monte Carlo (MCMC) methods in applications is how to determine when it is safe to stop sampling and use the samples to estimate characteristics of the distribution of interest. Research into methods of computing theoretical convergence bounds holds promise

Promising Performance of PA-Coded SIMO FM-DCSK Communication Systems

by Chaoxian Zhang, Lin Wang, Guanrong Chen, C. Zhang, L. Wang, C. Zhang, G. Chen , 2007
"... Abstract Frequency-modulated differential chaos shift keying (FM-DCSK) is an at-tractive scheme which combines chaotic modulation with the spread-spectrum prop-erty. It is simple to implement and robust in multipath fading channels. A single-input multiple-output (SIMO) FM-DCSK architecture has rece ..."
Abstract - Add to MetaCart
channels. It is found that, in contrast to low density parity check codes and convolutional codes, product accumulate (PA) codes can provide outstand-ing bit error rate performance improvement to the existing SIMO FM-DCSK system. In this paper, moreover, the optimum code rate for the PA-coded SIMO FM
Next 10 →
Results 11 - 20 of 21,793
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