Sciweavers

492 search results - page 48 / 99
» The number of possibilities for random dating
Sort
View
VLDB
2005
ACM
136views Database» more  VLDB 2005»
14 years 2 months ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal
PPOPP
1990
ACM
14 years 22 days ago
Employing Register Channels for the Exploitation of Instruction Level Parallelism
Abstract - A multiprocessor system capable of exploiting fine-grained parallelism must support efficient synchronization and data passing mechanisms. This paper demonstrates the us...
Rajiv Gupta
BMCBI
2007
132views more  BMCBI 2007»
13 years 8 months ago
Dependence of paracentric inversion rate on tract length
Background: We develop a Bayesian method based on MCMC for estimating the relative rates of pericentric and paracentric inversions from marker data from two species. The method al...
Thomas L. York, Richard Durrett, Rasmus Nielsen
ELPUB
2008
ACM
13 years 10 months ago
Global annual volume of peer reviewed scholarly articles and the share available via different Open Access options
A key parameter in any discussions about the academic peer reviewed journal system is the number of articles annually published. Several diverging estimates of this parameter have...
Bo-Christer Björk, Annikki Roos, Mari Lauri
INFOCOM
2009
IEEE
14 years 3 months ago
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks
— This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes ...
Eitan Altaian, Philippe Nain, Jean-Claude Bermond