663 search results - page 23 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
MLDM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
Dynamic replication algorithms aim at allocating, migrating and deleting copies of an object over various Internet hosts, according to the access patterns exhibited online, so as ...
DAGSTUHL
1997
13 years 9 months ago
1997
A realistic simulation system, which couples geometry and physics, can provide a useful toolkit for virtual environments. Interactions among moving objects in the virtual worlds a...
DAM
2000
13 years 7 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...