Sciweavers

484 search results - page 5 / 97
» Caching function calls using precise dependencies
Sort
View
LPAR
2001
Springer
13 years 11 months ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
HASKELL
2008
ACM
13 years 8 months ago
Language and program design for functional dependencies
Eight years ago, functional dependencies, a concept from the theory of relational databases, were proposed as a mechanism for avoiding common problems with multiple parameter type...
Mark P. Jones, Iavor S. Diatchki
HPCA
2005
IEEE
14 years 7 months ago
Effective Instruction Prefetching in Chip Multiprocessors for Modern Commercial Applications
In this paper, we study the instruction cache miss behavior of four modern commercial applications (a database workload, TPC-W, SPECjAppServer2002 and SPECweb99). These applicatio...
Lawrence Spracklen, Yuan Chou, Santosh G. Abraham
ICIP
2009
IEEE
13 years 5 months ago
Precise head segmentation on arbitrary backgrounds
We propose a method for segmentation of frontal human portraits from arbitrary unknown backgrounds. Semantic information is used to project the face into a normalized reference fr...
David C. Schneider, Benjamin Prestele, Peter Eiser...
LWA
2004
13 years 8 months ago
Modeling Rule Precision
This paper reports first results of an empirical study of the precision of classification rules on an independent test set. We generated a large number of rules using a general co...
Johannes Fürnkranz