Sciweavers

860 search results - page 39 / 172
» Completeness in two-party secure computation: a computationa...
Sort
View
156
Voted
CLEIEJ
2008
97views more  CLEIEJ 2008»
15 years 6 months ago
A finite bidimensional wavelet framework for computer graphics: Image equalization
A lot of material has been written about wavelet theory. Most of these texts provide an elegant framework from the functional and real analysis point of view. The complete infinit...
Francisco Jose Benavides Murillo, Edgar Benavides ...
HICSS
2003
IEEE
106views Biometrics» more  HICSS 2003»
15 years 11 months ago
An Alternative View of Knowledge Discovery
Inductive representation of conditional knowledge means to complete knowledge appropriately and can be looked upon as an instance of quite a general representation problem. The cr...
Christoph Beierle, Gabriele Kern-Isberner
BMCBI
2008
104views more  BMCBI 2008»
15 years 6 months ago
ReRep: Computational detection of repetitive sequences in genome survey sequences (GSS)
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
Thomas D. Otto, Leonardo H. F. Gomes, Marcelo Alve...
ATAL
2011
Springer
14 years 6 months ago
Decomposing constraint systems: equivalences and computational properties
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
Wiebe van der Hoek, Cees Witteveen, Michael Wooldr...
ASIACRYPT
2011
Springer
14 years 6 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer