Sciweavers

2009 search results - page 401 / 402
» Dense Interest Points
Sort
View
COMBINATORICA
2011
12 years 6 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
CRYPTO
2011
Springer
207views Cryptology» more  CRYPTO 2011»
12 years 6 months ago
Secure Computation on the Web: Computing without Simultaneous Interaction
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
Shai Halevi, Yehuda Lindell, Benny Pinkas
DAGSTUHL
2011
12 years 6 months ago
Feature Extraction for DW-MRI Visualization: The State of the Art and Beyond
By measuring the anisotropic self-diffusion rates of water, Diffusion Weighted Magnetic Resonance Imaging (DW-MRI) provides a unique noninvasive probe of fibrous tissue. In par...
Thomas Schultz
CRYPTO
2012
Springer
223views Cryptology» more  CRYPTO 2012»
11 years 9 months ago
Collusion-Preserving Computation
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassi...
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 9 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...