Sciweavers

492 search results - page 19 / 99
» The number of possibilities for random dating
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao
CIKM
2007
Springer
15 years 4 months ago
Randomized metric induction and evolutionary conceptual clustering for semantic knowledge bases
We present an evolutionary clustering method which can be applied to multi-relational knowledge bases storing resource annotations expressed in the standard languages for the Sema...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
PODC
2010
ACM
15 years 2 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
DATE
2010
IEEE
139views Hardware» more  DATE 2010»
15 years 3 months ago
Constant-time admission control for Deadline Monotonic tasks
—The admission control problem is concerned with determining whether a new task may be accepted by a system consisting of a set of running tasks, such that the already admitted a...
Alejandro Masrur, Samarjit Chakraborty, Georg F&au...
JUCS
2006
138views more  JUCS 2006»
14 years 10 months ago
Analysing Data of Childhood Acute Lymphoid Leukaemia by Seasonal Time Series Methods
: We examined the periodicity of the childhood leukaemia in Hungary using seasonal decomposition time series. Between 1988 and 2000 the number of annually diagnosed leukaemia (inci...
Maria Fazekas