Based on Information Theory, optimal feature selection should be carried out by searching Markov blankets. In this paper, we formally analyze the current Markov blanket discovery ...
— The separation of intradomain and interdomain routing has been a key feature of the Internet’s routing architecture from the early days of the ARPAnet. However, the appropria...
Renata Teixeira, Timothy G. Griffin, Mauricio G. C...
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...