Sciweavers

2027 search results - page 177 / 406
» When is it best to best-respond
Sort
View
BMCBI
2010
164views more  BMCBI 2010»
14 years 10 months ago
Merged consensus clustering to assess and improve class discovery with microarray data
Background: One of the most commonly performed tasks when analysing high throughput gene expression data is to use clustering methods to classify the data into groups. There are a...
T. Ian Simpson, J. Douglas Armstrong, Andrew P. Ja...
SIGIR
2011
ACM
14 years 4 months ago
Picasso - to sing, you must close your eyes and draw
We study the problem of automatically assigning appropriate music pieces to a picture or, in general, series of pictures. This task, commonly referred to as soundtrack suggestion,...
Aleksandar Stupar, Sebastian Michel
IACR
2011
139views more  IACR 2011»
14 years 29 days ago
Improved Meet-in-the-Middle Cryptanalysis of KTANTAN
We revisit meet-in-the-middle attacks on block ciphers and recent developments in meet-in-the-middle preimage attacks on hash functions. Despite the presence of a secret key in the...
Lei Wei, Christian Rechberger, Jian Guo 0001, Hong...
IACR
2011
128views more  IACR 2011»
14 years 29 days ago
Sign Modules in Secure Arithmetic Circuits
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
Ching-Hua Yu
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
13 years 3 months ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...