Sciweavers

4131 search results - page 216 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
15 years 5 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov
JAIR
2008
109views more  JAIR 2008»
15 years 3 months ago
Modular Reuse of Ontologies: Theory and Practice
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...
ICALP
2004
Springer
15 years 9 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
CVPR
2003
IEEE
15 years 9 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
JDA
2007
83views more  JDA 2007»
15 years 3 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes