Sciweavers

9871 search results - page 179 / 1975
» On the Structure of Low Sets
Sort
View
JOC
2000
95views more  JOC 2000»
15 years 6 months ago
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
Martin Hirt, Ueli M. Maurer
EVOW
2007
Springer
16 years 19 days ago
Overcompressing JPEG Images with Evolution Algorithms
Abstract. Overcompression is the process of post-processing compressed images to gain either further size reduction or improved quality. This is made possible by the fact that the ...
Jacques Lévy Véhel, Franklin Mendivi...
BMCBI
2010
108views more  BMCBI 2010»
15 years 6 months ago
Error, reproducibility and sensitivity : a pipeline for data processing of Agilent oligonucleotide expression arrays
Background: Expression microarrays are increasingly used to obtain large scale transcriptomic information on a wide range of biological samples. Nevertheless, there is still much ...
Benjamin Chain, Helen Bowen, John Hammond, Wilfrie...
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
15 years 11 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
ACSD
2001
IEEE
121views Hardware» more  ACSD 2001»
15 years 10 months ago
A structural encoding technique for the synthesis of asynchronous circuits
This paper presents a method for the automatic synthesis of asynchronous circuits from Petri net specifications. The method is based on a structural encoding of the system in such ...
Josep Carmona, Jordi Cortadella, Enric Pastor