Sciweavers

49 search results - page 2 / 10
» Cryptography with Constant Input Locality
Sort
View
DCOSS
2008
Springer
13 years 11 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis
DCG
2006
102views more  DCG 2006»
13 years 9 months ago
Three-Dimensional Delaunay Mesh Generation
We propose an algorithm to compute a conforming Delaunay mesh of a bounded domain specified by a piecewise linear complex. Arbitrarily small input angles are allowed, and the inpu...
Siu-Wing Cheng, Sheung-Hung Poon
COMPGEOM
2004
ACM
14 years 3 months ago
Quality meshing for polyhedra with small angles
We present an algorithm to compute a Delaunay mesh conforming to a polyhedron possibly with small input angles. The radius-edge ratio of most output tetrahedra are bounded by a co...
Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tath...
ECCC
2011
183views ECommerce» more  ECCC 2011»
13 years 4 months ago
Extractors and Lower Bounds for Locally Samplable Sources
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
Anindya De, Thomas Watson
FSTTCS
2009
Springer
14 years 4 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...