Sciweavers

479 search results - page 58 / 96
» On Static Properties of Specialized Programs
Sort
View
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 2 months ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin
WSC
2000
13 years 9 months ago
Mathematical programming models of discrete event system dynamics
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
Lee Schruben
VMCAI
2007
Springer
14 years 2 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 1 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
14 years 19 days ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington