683 search results - page 28 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
FC
2005
Springer
14 years 1 months ago
2005
Springer
We consider defenses against confidentiality and integrity attacks on data following break-ins, or so-called intrusion resistant storage technologies. We investigate the problem o...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
JMLR
2010
13 years 2 months ago
2010
Learning dynamic Bayesian network structures provides a principled mechanism for identifying conditional dependencies in time-series data. An important assumption of traditional D...
PPSN
2004
Springer
14 years 1 months ago
2004
Springer
Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models fr...