1272 search results - page 59 / 255 » The Set Cover with Pairs Problem |
IFSA
2007
Springer
15 years 7 months ago
2007
Springer
One of the important components of granular computing is interval computations. In interval computations, at each intermediate stage of the computation, we have intervals of possi...
101
Voted
JMLR
2006
15 years 22 days ago
2006
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
96
Voted
TCS
1998
15 years 12 days ago
1998
Recently a class of scalable multi-star optical networks is proposed in [2]. In this class of networks nodes are grouped into clusters. Each cluster employs a separate pair of bro...
106
click to vote
DATE
2004
IEEE
15 years 4 months ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
TIT
1998
15 years 12 days ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...