Sciweavers

46 search results - page 9 / 10
» Cut equivalence of fuzzy relations
Sort
View
DAM
2006
132views more  DAM 2006»
13 years 5 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
DAM
2008
140views more  DAM 2008»
13 years 5 months ago
The minimum spanning strong subdigraph problem is fixed parameter tractable
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
Jørgen Bang-Jensen, Anders Yeo
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
13 years 3 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
CORR
2010
Springer
67views Education» more  CORR 2010»
13 years 5 months ago
Similarity-based Reasoning in Qualified Logic Programming
Similarity-based Logic Programming (briefly, SLP) has been proposed to enhance the LP paradigm with a kind of approximate reasoning which supports flexible information retrieval a...
Rafael Caballero, Mario Rodríguez-Artalejo,...
CVPR
2009
IEEE
15 years 27 days ago
Shape Analysis with Conformal Invariants for Multiply Connected Domains and its Application to Analyzing Brain Morphology
All surfaces can be classified by the conformal equivalence relation. Conformal invariants, which are shape indices that can be defined intrinsically on a surface, may be used t...
Paul M. Thompson, Tony F. Chan, Xianfeng Gu, Yalin...