Sciweavers

103 search results - page 5 / 21
» The Arithmetical Complexity of Dimension and Randomness
Sort
View
RSA
2010
89views more  RSA 2010»
13 years 7 months ago
Some remarks on Betti numbers of random polygon spaces
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
Clément Dombry, Christian Mazza
IACR
2011
128views more  IACR 2011»
12 years 8 months ago
Sign Modules in Secure Arithmetic Circuits
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
Ching-Hua Yu
ISSAC
2009
Springer
144views Mathematics» more  ISSAC 2009»
14 years 3 months ago
H-LLL: using householder inside LLL
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
Ivan Morel, Damien Stehlé, Gilles Villard
FM
2009
Springer
101views Formal Methods» more  FM 2009»
14 years 1 months ago
Formal Reasoning about Expectation Properties for Continuous Random Variables
Abstract. Expectation (average) properties of continuous random variables are widely used to judge performance characteristics in engineering and physical sciences. This paper pres...
Osman Hasan, Naeem Abbasi, Behzad Akbarpour, Sofi&...
SIGMOD
2000
ACM
161views Database» more  SIGMOD 2000»
14 years 28 days ago
Answering Complex SQL Queries Using Automatic Summary Tables
We investigate the problem of using materialized views to answer SQL queries. We focus on modern decision-support queries, which involve joins, arithmetic operations and other (po...
Markos Zaharioudakis, Roberta Cochrane, George Lap...