Sciweavers

796 search results - page 145 / 160
» Approximating the centroid is hard
Sort
View
DATE
2010
IEEE
182views Hardware» more  DATE 2010»
14 years 19 days ago
Fault-based attack of RSA authentication
For any computing system to be secure, both hardware and software have to be trusted. If the hardware layer in a secure system is compromised, not only it would be possible to ext...
Andrea Pellegrini, Valeria Bertacco, Todd M. Austi...
ISCA
2010
IEEE
214views Hardware» more  ISCA 2010»
14 years 19 days ago
Re-architecting DRAM memory systems with monolithically integrated silicon photonics
The performance of future manycore processors will only scale with the number of integrated cores if there is a corresponding increase in memory bandwidth. Projected scaling of el...
Scott Beamer, Chen Sun, Yong-Jin Kwon, Ajay Joshi,...
HT
2010
ACM
14 years 19 days ago
Of categorizers and describers: an evaluation of quantitative measures for tagging motivation
While recent research has advanced our understanding about the structure and dynamics of social tagging systems, we know little about (i) the underlying motivations for tagging (w...
Christian Körner, Roman Kern, Hans-Peter Grah...
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 19 days ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 11 days ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier