Sciweavers

116 search results - page 13 / 24
» A practical access to the theory of parallel algorithms
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
PODC
1994
ACM
13 years 11 months ago
A Performance Evaluation of Lock-Free Synchronization Protocols
In this paper, we investigate the practical performance of lock-free techniques that provide synchronization on shared-memory multiprocessors. Our goal is to provide a technique t...
Anthony LaMarca
PODS
2001
ACM
148views Database» more  PODS 2001»
14 years 7 months ago
On the Design and Quantification of Privacy Preserving Data Mining Algorithms
The increasing ability to track and collect large amounts of data with the use of current hardware technology has lead to an interest in the development of data mining algorithms ...
Dakshi Agrawal, Charu C. Aggarwal
IJHPCA
2006
99views more  IJHPCA 2006»
13 years 7 months ago
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always incre...
Lionel Eyraud
PODC
2006
ACM
14 years 1 months ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...