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

Hit rate, H

by Robin J. Hogan, Ewan J. O'connor, Anthony J. Illingworth, Heidke Skill Score , 2003
"... as n → 0 ..."
Abstract - Add to MetaCart
Abstract not found

Determining Hit Rate in Pattern Search

by Richard Bolton David, David J. H, Niall M. Adams, Sw Bz , 2002
"... The problem of spurious apparent patterns arising by chance is a fundamental one for pattern detection. Classical approaches, based on adjustments such as the Bonferroni procedure, are arguably not appropriate in a data mining context. Instead, methods based on the false discovery rate - the proport ..."
Abstract - Add to MetaCart
The problem of spurious apparent patterns arising by chance is a fundamental one for pattern detection. Classical approaches, based on adjustments such as the Bonferroni procedure, are arguably not appropriate in a data mining context. Instead, methods based on the false discovery rate

An Analytical Model for Buffer Hit Rate Prediction

by Yongli (Lily) Xi, Patrick Martin, Wendy Powley - In CASCON ’01: Proc. Conf. of the Centre for Advanced Studies on Collaborative Research. IBM , 2001
"... Of the many tuning parameters available in a database management system (DBMS), one of the most crucial to performance is the buffer pool size. Choosing an appropriate size, however, can be a difficult task. In this paper we present an analytical modeling approach to predicting the buffer pool hit r ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
rate that can be used to simplify the process of buffer pool sizing. Since the buffer replacement algorithm determines the buffer hit rate, we model the replacement algorithm which, in the case of DB2/UDB, is a variation of the GCLOCK algorithm. A Markov Chain model of GCLOCK is used to estimate

Using Name-Based Mappings to Increase Hit Rates

by David G. Thaler, Chinya V. Ravishankar - IEEE/ACM TRANSACTIONS ON NETWORKING , 1997
"... Clusters of identical intermediate servers are often created to improve availability and robustness in many domains. The use of proxy servers for the WWW and of Rendezvous Points in multicast routing are two such situations. However, this approach can be inefficient if identical requests are receive ..."
Abstract - Cited by 84 (6 self) - Add to MetaCart
Clusters of identical intermediate servers are often created to improve availability and robustness in many domains. The use of proxy servers for the WWW and of Rendezvous Points in multicast routing are two such situations. However, this approach can be inefficient if identical requests are received and processed by multiple servers. We present an analysis of this problem, and develop a method called the Highest Random Weight (HRW) Mapping that eliminates these difficulties. Given an object name and a set of servers, HRW maps a request to a server using the object name, rather than any a priori knowledge of server states. Since HRW always maps a given object name to the same server within a given cluster, it may be used locally at client sites to achieve consensus on objectserver mappings. We present an analysis of HRW and validate it with simulation results showing that it gives faster service times than traditional request allocation schemes such as round-robin or least-loaded, and...

Approved for External Publication Estimating Cache Hit Rates from the Miss Sequence

by Timothy Y. Chow, Terence P. Kelly, Daniel M. Reeves, Timothy Y. Chow, Daniel M. Reeves, Terence P. Kelly , 2007
"... cache, hit rate, estimation, LRU stack distance, success function * Internal Accession Date Only This paper considers the problem of inferring cache hit rates from observations of references that miss in the cache. In the Web context, this is the problem of inferring a browser's cache hit rate ..."
Abstract - Add to MetaCart
cache, hit rate, estimation, LRU stack distance, success function * Internal Accession Date Only This paper considers the problem of inferring cache hit rates from observations of references that miss in the cache. In the Web context, this is the problem of inferring a browser's cache hit rate

Ad Insertion At Proxies to Improve Cache Hit Rates

by Amit Gupta, Geoffrey Baehr - In Proceedings of the 4th International Web Caching Workshop , 1999
"... Web proxies use caching to improve client performance (reduced access latency) and network performance (reduced traffic); with caching, some of the client requests are served by a local cache, without any contact with the original content server. As online advertising is a major revenue source for m ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
, the content-providers can now allow the proxies to serve multiple clients with different ads from the same cached data stream. In this manner, proxybased ad insertion improves cache hit rates. We begin by describing the problems generated by the use of cache-busting techniques today. We will then describe

An extended set of Haar-like features for rapid objection detection

by Rainer Lienhart, Jochen Maydt - IEEE ICIP
"... Recently Viola et al. [5] have introduced a rapid object detection scheme based on a boosted cascade of simple feature classifiers. In this paper we introduce a novel set of rotated haar-like features. These novel features significantly enrich the simple features of [5] and can also be calculated ef ..."
Abstract - Cited by 577 (4 self) - Add to MetaCart
efficiently. With these new rotated features our sample face detector shows off on average a 10 % lower false alarm rate at a given hit rate. We also present a novel post optimization procedure for a given boosted cascade improving on average the false alarm rate further by 12.5%. 1

Hitting the Memory Wall: Implications of the Obvious

by Wm. A. Wulf, Sally A. Mckee - Computer Architecture News , 1995
"... This brief note points out something obvious--- something the authors "knew" without really understanding. With apologies to those who did understand, we offer it to those others who, like us, missed the point. We all know that the rate of improvement in microprocessor speed exceeds the ra ..."
Abstract - Cited by 393 (1 self) - Add to MetaCart
This brief note points out something obvious--- something the authors "knew" without really understanding. With apologies to those who did understand, we offer it to those others who, like us, missed the point. We all know that the rate of improvement in microprocessor speed exceeds

Trading Cache Hit Rate for Memory Performance

by Wei Ding, Mahmut K, Diana Guttman, Adwait Jog, Chita R. Das, Praveen Yedlapalli
"... Most of the prior compiler based data locality optimization works target exclusively cache locality optimization, and row-buffer locality in DRAM banks received much less atten-tion. In particular, to the best of our knowledge, there is no single compiler based approach that can improve row-buffer l ..."
Abstract - Add to MetaCart
Most of the prior compiler based data locality optimization works target exclusively cache locality optimization, and row-buffer locality in DRAM banks received much less atten-tion. In particular, to the best of our knowledge, there is no single compiler based approach that can improve row-buffer locality in executing irregular applications. This presents a critical problem considering the fact that executing irregu-lar applications in a power and performance efficient man-ner will be a key requirement to extract maximum bene-fits from emerging multicore machines and exascale systems. Motivated by these observations, this paper makes the fol-lowing contributions. First, it presents a compiler-runtime cooperative data layout optimization approach that takes as input an irregular program that has already been opti-mized for cache locality and generates an output code with the same cache performance but better row-buffer locality (lower number of row-buffer misses). Second, it discusses a more aggressive strategy that sacrifices some cache perfor-mance in order to further improve row-buffer performance (i.e., it trades cache performance for memory system per-formance). The ultimate goal of this strategy is to find the right tradeoff point between cache performance and row-buffer performance so that the overall application perfor-mance is improved. Third, the paper performs a detailed evaluation of these two approaches using both an AMD Opteron based multicore system and a multicore simulator. The experimental results, collected using five real-world ir-regular applications, show that (i) conventional cache opti-mizations do not improve row-buffer locality significantly; (ii) our first approach achieves about 9.8 % execution time improvement by keeping the number of cache misses the same as a cache-optimized code but reducing the number of row-buffer misses; and (iii) our second approach achieves even higher execution time improvements (13.8 % on aver-age) by sacrificing cache performance for additional memory performance.

Financial Intermediation, Loanable Funds, and the Real Sector

by Bengt Holmstrom, Jean Tirole - Quarterly Journal of Economics , 1997
"... We study an incentive model of ®nancial intermediation in which ®rms as well as intermediaries are capital constrained. We analyze how the distribution of wealth across ®rms, intermediaries, and uninformed investors affects investment, interest rates, and the intensity of monitoring. We show that al ..."
Abstract - Cited by 547 (7 self) - Add to MetaCart
that all forms of capital tightening (a credit crunch, a collateral squeeze, or a savings squeeze) hit poorly capitalized ®rms the hardest, but that interest rate effects and the intensity of monitoring will depend on relative changes in the various components of capital. The predictions of the model
Next 10 →
Results 1 - 10 of 2,475
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