841 search results - page 127 / 169 » Approximability of Minimum AND-Circuits |
DIS
2001
Springer
14 years 2 months ago
2001
Springer
Scientists need customizable tools to help them with discovery. We present an adjustable heuristic function for scientific discovery. This function may be considered in either a Mi...
MOBIHOC
2002
ACM
14 years 9 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
ICML
2009
IEEE
14 years 11 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...