Sciweavers

533 search results - page 106 / 107
» Playing games with approximation algorithms
Sort
View
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 11 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
ISCA
2010
IEEE
237views Hardware» more  ISCA 2010»
13 years 6 months ago
High performance cache replacement using re-reference interval prediction (RRIP)
Practical cache replacement policies attempt to emulate optimal replacement by predicting the re-reference interval of a cache block. The commonly used LRU replacement policy alwa...
Aamer Jaleel, Kevin B. Theobald, Simon C. Steely J...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 7 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
GLVLSI
2008
IEEE
147views VLSI» more  GLVLSI 2008»
14 years 1 months ago
Statistical timing analysis of flip-flops considering codependent setup and hold times
Statistical static timing analysis (SSTA) plays a key role in determining performance of the VLSI circuits implemented in state-of-the-art CMOS technology. A pre-requisite for emp...
Safar Hatami, Hamed Abrishami, Massoud Pedram
SIGIR
2010
ACM
13 years 11 months ago
Extending average precision to graded relevance judgments
Evaluation metrics play a critical role both in the context of comparative evaluation of the performance of retrieval systems and in the context of learning-to-rank (LTR) as objec...
Stephen E. Robertson, Evangelos Kanoulas, Emine Yi...