Sciweavers

5326 search results - page 891 / 1066
» On what we can ensure
Sort
View
TNN
2010
148views Management» more  TNN 2010»
15 years 1 months ago
A fast algorithm for robust mixtures in the presence of measurement errors
Abstract--In experimental and observational sciences, detecting atypical, peculiar data from large sets of measurements has the potential of highlighting candidates of interesting ...
Jianyong Sun, Ata Kabán
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
13 years 9 months ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...
ATAL
2010
Springer
15 years 6 months ago
Using answer set programming to model multi-agent scenarios involving agents' knowledge about other's knowledge
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
Chitta Baral, Gregory Gelfond, Tran Cao Son, Enric...
BMCBI
2006
108views more  BMCBI 2006»
15 years 6 months ago
Probe set algorithms: is there a rational best bet?
Affymetrix microarrays have become a standard experimental platform for studies of mRNA expression profiling. Their success is due, in part, to the multiple oligonucleotide featur...
Jinwook Seo, Eric P. Hoffman
INFOCOM
2011
IEEE
14 years 10 months ago
Understanding robustness of mobile networks through temporal network measures
—The application of complex network theory to communication systems has led to several important results. Nonetheless, previous research has often neglected to take into account ...
Salvatore Scellato, Ilias Leontiadis, Cecilia Masc...