Sciweavers

13784 search results - page 277 / 2757
» On Computing Functions with Uncertainty
Sort
View
ICIP
2008
IEEE
16 years 1 months ago
On the security of non-forgeable robust hash functions
In many applications, it is often desirable to extract a consistent key from a multimedia object (e.g., an image), even when the object has gone through a noisy channel. For examp...
Qiming Li, Sujoy Roy
DOCENG
2007
ACM
15 years 10 months ago
Logical document conversion: combining functional and formal knowledge
We present in this paper a method for document layout analysis based on identifying the function of document elements (what they do). This approach is orthogonal and complementary...
Hervé Déjean, Jean-Luc Meunier
DAC
2001
ACM
16 years 7 months ago
Factoring and Recognition of Read-Once Functions using Cographs and Normality
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
Martin Charles Golumbic, Aviad Mintz, Udi Rotics
FSTTCS
2009
Springer
16 years 1 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...
ACMSE
2006
ACM
16 years 16 days ago
Using genetic algorithms to generate test plans for functionality testing
Like in other fields, computer products (applications, hardware, etc.), before being marketed, require some level of testing to verify whether they meet their design and function...
Francisca Emanuelle Vieira, Francisco Martins, Raf...