252 search results - page 37 / 51 » Decremental Clique Problem |
IPL
2011
14 years 4 months ago
2011
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
IMC
2006
ACM
15 years 3 months ago
2006
ACM
An accurate router-level topology of the Internet would benefit many research areas, including network diagnosis, inter-domain traffic engineering, and overlay construction. We ...
CONCUR
2000
Springer
15 years 1 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
MP
2006
14 years 9 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
171
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We propose a framework, called MIC, which adopts an information-theoretic approach to address the problem of quantitative association rule mining. In our MIC framework, we first d...