223 search results - page 10 / 45 » A Compiler Scheme for Reusing Intermediate Computation Resul... |
VLDB
1990
ACM
13 years 12 months ago
1990
ACM
Bottom-up evaluation of deductive database programs has the advantage that it avoids repeated computation by storing all intermediate results and replacing recomputation by table ...
ECRIME
2007
13 years 12 months ago
2007
We propose a scheme that exploits scale to prevent phishing. We show that while stopping phishers from obtaining passwords is very hard, detecting the fact that a password has bee...
EUROCAST
2007
Springer
13 years 11 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRFs o...
ISQED
2006
IEEE
14 years 1 months ago
2006
IEEE
As transistor counts keep increasing and clock frequencies rise, high power consumption is becoming one of the most important obstacles, preventing further scaling and performance...