461 search results - page 5 / 93 » Splitting NP-Complete Sets |
ADHOCNOW
2010
Springer
13 years 7 months ago
2010
Springer
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...
TON
2012
12 years 6 days ago
2012
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
SIAMDM
2000
13 years 9 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...
IJCNN
2006
IEEE
14 years 3 months ago
2006
IEEE
—In this paper we propose a new graph-based feature splitting algorithm maxInd, which creates a balanced split maximizing the independence between the two feature sets. We study ...
CORR
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...