2434 search results - page 5 / 487 » Algorithmic Randomness of Closed Sets |
102
click to vote
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
105
click to vote
EDBT
2011
ACM
14 years 28 days ago
2011
ACM
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
KDD
2002
ACM
15 years 9 months ago
2002
ACM
We present a closed set data mining paradigm which is particularly e ective for uncovering the kind of deterministic, causal dependencies that characterize much of basic science. ...
TSP
2008
14 years 9 months ago
2008
This paper presents a novel and mathematically rigorous Bayes recursion for tracking a target that generates multiple measurements with state dependent sensor field of view and clu...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...