Sciweavers

394 search results - page 25 / 79
» Expected Case for Projecting Points
Sort
View
FOCS
1999
IEEE
15 years 1 months ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled
74
Voted
EUROCRYPT
2007
Springer
15 years 3 months ago
Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit
Significant progress in the design of special purpose hardware for supporting the Number Field Sieve (NFS) has been made. From a practical cryptanalytic point of view, however, no...
Willi Geiselmann, Rainer Steinwandt
ICIP
1999
IEEE
15 years 11 months ago
3D Voxel Construction Based on Epipolar Geometry
In this paper, we propose an approach for construction of a projective 3D voxel space based on epipolar geometry obtained with weak calibration. This concept of voxel space define...
Makoto Kimura, Hideo Saito, Takeo Kanade
CORR
2010
Springer
148views Education» more  CORR 2010»
14 years 9 months ago
Perturbation Resilience and Superiorization of Iterative Algorithms
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there...
Yair Censor, R. Davidi, Gabor T. Herman
CORR
2010
Springer
58views Education» more  CORR 2010»
14 years 9 months ago
Soundly Handling Static Fields: Issues, Semantics and Analysis
Although in most cases class initialization works as expected, some static fields may be read before being initialized, despite being initialized in their corresponding class init...
Laurent Hubert, David Pichardie