2434 search results - page 4 / 487 » Algorithmic Randomness of Closed Sets |
WEA
2005
Springer
13 years 11 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
IJCAI
2007
13 years 7 months ago
2007
We investigate the problem of mining closed sets in multi-relational databases. Previous work introduced different semantics and associated algorithms for mining closed sets in mu...
ECML
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents a decoupled two stage solution to the multiple-instance learning (MIL) problem. With a constructed affinity matrix to reflect the instance relations, a modified...
SIGMETRICS
2010
ACM
13 years 10 months ago
2010
ACM
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...
COMBINATORICA
2010
13 years 3 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...