Sciweavers

307 search results - page 23 / 62
» On Equations over Sets of Integers
Sort
View
IPPS
1998
IEEE
13 years 11 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
JISE
2006
76views more  JISE 2006»
13 years 7 months ago
Process and Planning Support for Iterative Porting
in an abstract Cartesian space of program versions characterized by dialect variables. An optimal solution to the problem is derived based on its translation to a restricted Intege...
Pradeep Varma
ICMCS
2005
IEEE
130views Multimedia» more  ICMCS 2005»
14 years 1 months ago
The photodynamic tool: generation of animation from a single texture image
This paper proposes a new animation editing method for creating animations from a single texture image. A standard warping method can not handle a physical motion effect because o...
Hidetomo Sakaino
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 8 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 11 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi