Sciweavers

42388 search results - page 8105 / 8478
» Classification Using Information
Sort
View
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 9 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
15 years 9 months ago
Assessing regret-based preference elicitation with the UTPREF recommendation system
Product recommendation and decision support systems must generally develop a model of user preferences by querying or otherwise interacting with a user. Recent approaches to elici...
Darius Braziunas, Craig Boutilier
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 9 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
SIGMOD
2010
ACM
598views Database» more  SIGMOD 2010»
15 years 9 months ago
Ricardo: integrating R and Hadoop
Many modern enterprises are collecting data at the most detailed level possible, creating data repositories ranging from terabytes to petabytes in size. The ability to apply sophi...
Sudipto Das, Yannis Sismanis, Kevin S. Beyer, Rain...
EUROCRYPT
2010
Springer
15 years 9 months ago
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
Serge Fehr, Dennis Hofheinz, Eike Kiltz, Hoeteck W...
« Prev « First page 8105 / 8478 Last » Next »