492 search results - page 65 / 99 » The number of possibilities for random dating |
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function f : {0, 1}n → {0, 1}m where each bit of output is a fixed predicate P of a constant number ...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
HICSS
2007
IEEE
14 years 3 months ago
2007
IEEE
The interest in pair programming (PP) has increased recently, e.g. by the popularization of agile software development. However, many practicalities of PP are poorly understood. W...
ISPW
2007
IEEE
14 years 3 months ago
2007
IEEE
The possible variability of project delay is useful information to understand and mitigate the project delay risk. However, it is not sufficiently considered in the literature con...
HIPC
2007
Springer
14 years 2 months ago
2007
Springer
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...