Sciweavers

1760 search results - page 18 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
EMNLP
2010
13 years 5 months ago
Automatic Discovery of Manner Relations and its Applications
This paper presents a method for the automatic discovery of MANNER relations from text. An extended definition of MANNER is proposed, including restrictions on the sorts of concep...
Eduardo Blanco, Dan I. Moldovan
ICC
2009
IEEE
136views Communications» more  ICC 2009»
14 years 2 months ago
Fast Connected Dominating Set Construction in Mobile Ad Hoc Networks
—The connected dominating set (CDS) has been commonly used for routing and broadcast in mobile ad hoc networks (MANETs). Considering the applications of MANETs, it is generally p...
Kazuya Sakai, Min-Te Sun, Wei-Shinn Ku
IJCAI
2001
13 years 9 months ago
The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding
A tight integration of Mitchell's version space algorithm with Agrawal et al.'s Apriori algorithm is presented. The algorithm can be used to generate patterns that satis...
Luc De Raedt, Stefan Kramer
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
11 years 10 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...