Sciweavers

529 search results - page 43 / 106
» Simple Random Logic Programs
Sort
View
ICALP
2004
Springer
14 years 3 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
BIRTHDAY
2012
Springer
12 years 5 months ago
Masking with Randomized Look Up Tables - Towards Preventing Side-Channel Attacks of All Orders
We propose a new countermeasure to protect block ciphers implemented in leaking devices, at the intersection between One-Time Programs and Boolean masking schemes. First, we show t...
François-Xavier Standaert, Christophe Petit...
POPL
1995
ACM
14 years 1 months ago
Default Timed Concurrent Constraint Programming
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
STOC
2001
ACM
116views Algorithms» more  STOC 2001»
14 years 10 months ago
One line and n points
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
Bernd Gärtner, József Solymosi, Falk T...
TOOLS
2010
IEEE
14 years 3 months ago
Contract-Driven Testing of JavaScript Code
JSContest is a tool that enhances JavaScript with simple, type-like contracts and provides a framework for monitoring and guided random testing of programs against these contracts ...
Phillip Heidegger, Peter Thiemann