Sciweavers

1710 search results - page 96 / 342
» High-Level Programs and Program Conditions
Sort
View
ASIACRYPT
2008
Springer
13 years 10 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
ASPLOS
2009
ACM
14 years 2 months ago
Performance analysis of accelerated image registration using GPGPU
This paper presents a performance analysis of an accelerated 2-D rigid image registration implementation that employs the Compute Unified Device Architecture (CUDA) programming e...
Peter Bui, Jay B. Brockman
EMSOFT
2007
Springer
14 years 2 months ago
E-FRP with priorities
E-FRP is declarative language for programming resourcebounded, event-driven systems. The original high-level semantics of E-FRP requires that each event handler execute atomically...
Roumen Kaiabachev, Walid Taha, Angela Yun Zhu
OOPSLA
2010
Springer
13 years 6 months ago
A simple inductive synthesis methodology and its applications
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Moo...
SIGMOD
2004
ACM
142views Database» more  SIGMOD 2004»
14 years 8 months ago
Conditional Selectivity for Statistics on Query Expressions
Cardinality estimation during query optimization relies on simplifying assumptions that usually do not hold in practice. To diminish the impact of inaccurate estimates during opti...
Nicolas Bruno, Surajit Chaudhuri