2084 search results - page 413 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
PET
2010
Springer
14 years 11 days ago
2010
Springer
We investigate the degree to which modern web browsers are subject to “device fingerprinting” via the version and configuration information that they will transmit to website...
SIGIR
2002
ACM
13 years 8 months ago
2002
ACM
In this paper, we propose a document clustering method that strives to achieve: (1) a high accuracy of document clustering, and (2) the capability of estimating the number of clus...
PPOPP
2010
ACM
14 years 5 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
BICOB
2009
Springer
14 years 3 months ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...