Sciweavers

301 search results - page 15 / 61
» An efficient algorithm to verify generalized false paths
Sort
View
CC
2010
Springer
117views System Software» more  CC 2010»
13 years 5 months ago
Efficiently Certifying Non-Integer Powers
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
Erich Kaltofen, Mark Lavin
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
14 years 12 days ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
SAC
2010
ACM
13 years 6 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...
JMLR
2010
151views more  JMLR 2010»
13 years 3 months ago
The Feature Selection Path in Kernel Methods
The problem of automatic feature selection/weighting in kernel methods is examined. We work on a formulation that optimizes both the weights of features and the parameters of the ...
Fuxin Li, Cristian Sminchisescu
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
14 years 1 months ago
Model Checking Discounted Temporal Properties
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...
Luca de Alfaro, Marco Faella, Thomas A. Henzinger,...