Sciweavers

548 search results - page 100 / 110
» Secure peer sampling
Sort
View
OOPSLA
2007
Springer
15 years 4 months ago
Using hpm-sampling to drive dynamic compilation
All high-performance production JVMs employ an adaptive strategy for program execution. Methods are first executed unoptimized and then an online profiling mechanism is used to ...
Dries Buytaert, Andy Georges, Michael Hind, Matthe...
78
Voted
IPPS
2005
IEEE
15 years 4 months ago
MOCCA - Towards a Distributed CCA Framework for Metacomputing
— We describe the design and implementation of MOCCA, a distributed CCA framework implemented using the H2O metacomputing system. Motivated by the quest for appropriate metasyste...
Maciej Malawski, Dawid Kurzyniec, Vaidy S. Sundera...
IH
2004
Springer
15 years 3 months ago
Empirical and Theoretical Evaluation of Active Probing Attacks and Their Countermeasures
A variety of remote sensing attacks allow adversaries to break flow confidentiality and gather mission-critical information in distributed systems. Such attacks are easily supple...
Xinwen Fu, Bryan Graham, Dong Xuan, Riccardo Betta...
IUI
2010
ACM
15 years 3 months ago
Towards a reputation-based model of social web search
While web search tasks are often inherently collaborative in nature, many search engines do not explicitly support collaboration during search. In this paper, we describe HeyStaks...
Kevin KcNally, Michael P. O'Mahony, Barry Smyth, M...
CRYPTO
2003
Springer
187views Cryptology» more  CRYPTO 2003»
15 years 3 months ago
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
Salil P. Vadhan