Sciweavers

3657 search results - page 249 / 732
» A Study of Practical Deduplication
Sort
View
168
Voted
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
16 years 1 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
185
Voted
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
16 years 1 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon
CRYPTO
2009
Springer
119views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
How Risky Is the Random-Oracle Model?
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
Gaëtan Leurent, Phong Q. Nguyen
EMO
2009
Springer
190views Optimization» more  EMO 2009»
16 years 1 months ago
Solving Bilevel Multi-Objective Optimization Problems Using Evolutionary Algorithms
Abstract. Bilevel optimization problems require every feasible upperlevel solution to satisfy optimality of a lower-level optimization problem. These problems commonly appear in ma...
Kalyanmoy Deb, Ankur Sinha
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin