Sciweavers

1578 search results - page 156 / 316
» Algorithmic randomness of continuous functions
Sort
View
CANS
2009
Springer
169views Cryptology» more  CANS 2009»
14 years 4 months ago
Privacy-Preserving Relationship Path Discovery in Social Networks
As social networks sites continue to proliferate and are being used for an increasing variety of purposes, the privacy risks raised by the full access of social networking sites ov...
Ghita Mezzour, Adrian Perrig, Virgil D. Gligor, Pa...
VMV
2003
154views Visualization» more  VMV 2003»
13 years 11 months ago
Piecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
Jianhua Wu, Leif Kobbelt
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 1 months ago
PHCpack in Macaulay2
The Macaulay2 package PHCpack.m2 provides an interface to some of the functionality of PHCpack, a general-purpose solver for polynomial systems by homotopy continuation. The main f...
Elizabeth Gross, Sonja Petrovic, Jan Verschelde
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
14 years 3 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
COMPGEOM
1997
ACM
14 years 2 months ago
Cylindrical Static and Kinetic Binary Space Partitions
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Mural...