Sciweavers

4377 search results - page 782 / 876
» Mass problems and randomness
Sort
View
DRM
2003
Springer
15 years 10 months ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin
FCT
2003
Springer
15 years 10 months ago
On Boundaries of Highly Visible Spaces and Applications
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...
John H. Reif, Zheng Sun
COMPGEOM
2010
ACM
15 years 10 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
PLDI
2010
ACM
15 years 10 months ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 10 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor