1547 search results - page 193 / 310 » Solving Knapsack Problems in a Sticker Based Model |
131
click to vote
NFM
2011
14 years 10 months ago
2011
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
173
click to vote
PET
2012
Springer
13 years 5 months ago
2012
Springer
It is widely accepted that Disclosure Attacks are effective against high-latency anonymous communication systems. A number of Disclosure Attack variants can be found in the litera...
130
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We address the problem of incorporating user preference in automatic image enhancement. Unlike generic tools for automatically enhancing images, we seek to develop methods that ca...
132
click to vote
TR
2008
15 years 3 months ago
2008
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
119
Voted
AUTOMATICA
2004
15 years 3 months ago
2004
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...