2957 search results - page 487 / 592 » The Complexity of Polynomial-Time Approximation |
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
Intuitively, aggressive work sharing among concurrent queries in a database system should always improve performance by eliminating redundant computation or data accesses. We show...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...
WAIM
2007
Springer
14 years 1 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...
ACSC
2006
IEEE
14 years 1 months ago
2006
IEEE
Non-linear projections of 3D graphical scenes can be used to compute reflections and refractions in curved surfaces, draw artistic images in the style of Escher or Picasso, and p...