Sciweavers

15494 search results - page 3006 / 3099
» Computing dynamic clusters
Sort
View
WWW
2001
ACM
14 years 10 months ago
Enabling full service surrogates using the portable channel representation
The simplicity of the basic client/server model of Web services led quickly to its widespread adoption, but also to scalability and performance problems. The technological respons...
Micah Beck, Terry Moore, Leif Abrahamsson, Christo...
ASPLOS
2009
ACM
14 years 10 months ago
Kendo: efficient deterministic multithreading in software
Although chip-multiprocessors have become the industry standard, developing parallel applications that target them remains a daunting task. Non-determinism, inherent in threaded a...
Marek Olszewski, Jason Ansel, Saman P. Amarasinghe
ASPLOS
2009
ACM
14 years 10 months ago
RapidMRC: approximating L2 miss rate curves on commodity systems for online optimizations
Miss rate curves (MRCs) are useful in a number of contexts. In our research, online L2 cache MRCs enable us to dynamically identify optimal cache sizes when cache-partitioning a s...
David K. Tam, Reza Azimi, Livio Soares, Michael St...
PKC
2009
Springer
140views Cryptology» more  PKC 2009»
14 years 10 months ago
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Abstract. The success of electronic authentication systems, be it eID card systems or Internet authentication systems such as CardSpace, highly depends on the provided level of use...
Jan Camenisch, Markulf Kohlweiss, Claudio Soriente
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 10 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
« Prev « First page 3006 / 3099 Last » Next »