Sciweavers

16404 search results - page 282 / 3281
» A set coverage problem
Sort
View
CORR
2010
Springer
100views Education» more  CORR 2010»
15 years 4 months ago
Shortest paths between shortest paths and independent sets
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
Marcin Kaminski, Paul Medvedev, Martin Milanic
FSS
2007
82views more  FSS 2007»
15 years 4 months ago
An empirical test of some measurement-theoretic axioms for fuzzy sets
In the previous years some authors have been elaborating on the measurementtheoretic foundations of fuzzy set theory. A well-known problem in this approach is the difficult applic...
C. Desimpelaere, Thierry Marchant
PRL
2006
308views more  PRL 2006»
15 years 4 months ago
Image reconstruction from a complete set of similarity invariants extracted from complex moments
Various types of moments have been used to recognize image patterns in a number of applications. However, only few works have paid attention to the completeness property of the in...
Faouzi Ghorbel, Stéphane Derrode, Rim Mezho...
129
Voted
IJCV
2002
140views more  IJCV 2002»
15 years 4 months ago
Orthonormal Vector Sets Regularization with PDE's and Applications
We are interested in regularizing fields of orthonormal vector sets, using constraint-preserving anisotropic diffusion PDE's. Each point of such a field is defined by multiple...
David Tschumperlé, Rachid Deriche
PAMI
2007
113views more  PAMI 2007»
15 years 4 months ago
Dominant Sets and Pairwise Clustering
—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
Massimiliano Pavan, Marcello Pelillo