152 search results - page 20 / 31 » Constructive Proofs of Concentration Bounds |
ASIACRYPT
2000
Springer
13 years 12 months ago
2000
Springer
nded abstract of this work appears Advances in Cryptology — Asiacrypt 2000, Tatsuaki Okamoto, editor, Lecture Notes in Computer Science vol. 1976, Springer-Verlag, 2000. c IACR A...
ADCM
2007
13 years 7 months ago
2007
In this paper we provide an extension of barycentric coordinates from simplices to arbitrary convex sets. Barycentric coordinates over convex 2D polygons have found numerous appli...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
BIOCOMP
2007
13 years 9 months ago
2007
Background: Genetic regulatory networks (GRN) can be described by differential equations with SUM logic which has been found in many natural systems. Identification of the network...
TVCG
2012
11 years 10 months ago
2012
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...