Sciweavers

2321 search results - page 14 / 465
» Multiple Predicate Learning
Sort
View
HPCA
2007
IEEE
15 years 10 months ago
Improving Branch Prediction and Predicated Execution in Out-of-Order Processors
If-conversion is a compiler technique that reduces the misprediction penalties caused by hard-to-predict branches, transforming control dependencies into data dependencies. Althou...
Eduardo Quiñones, Joan-Manuel Parcerisa, An...
90
Voted
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
15 years 9 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
88
Voted
ASPLOS
2008
ACM
14 years 11 months ago
Improving the performance of object-oriented languages with dynamic predication of indirect jumps
Indirect jump instructions are used to implement increasinglycommon programming constructs such as virtual function calls, switch-case statements, jump tables, and interface calls...
José A. Joao, Onur Mutlu, Hyesoon Kim, Rish...
ISCA
1995
IEEE
120views Hardware» more  ISCA 1995»
15 years 1 months ago
Unconstrained Speculative Execution with Predicated State Buffering
Speculative execution is execution of instructions before it is known whether these instructions should be executed. Compiler-based speculative execution has the potential to achi...
Hideki Ando, Chikako Nakanishi, Tetsuya Hara, Masa...
ACL
2010
14 years 7 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger