976 search results - page 56 / 196 » The Complexity of Timetable Construction Problems |
102
click to vote
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
109
click to vote
ASIACRYPT
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We provide a general framework for constructing identitybased and broadcast encryption systems. In particular, we construct a general encryption system called spatial enc...
PR
2000
14 years 11 months ago
2000
The problem of the independence and completeness of rotation moment invariants is addressed in this paper. First, a general method for constructing invariants of arbitrary orders ...
WAIM
2007
Springer
15 years 6 months ago
2007
Springer
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
115
click to vote
WADS
2007
Springer
15 years 6 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...