15485 search results - page 155 / 3097 » Computing Optimal Subsets |
151
click to vote
SIAMDM
1998
15 years 5 months ago
1998
In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a small...
160
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
196
click to vote
GAMESEC
2010
15 years 4 months ago
2010
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
170
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
180
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...