Sciweavers

1093 search results - page 46 / 219
» Clustering from Constraint Graphs
Sort
View
VL
2003
IEEE
146views Visual Languages» more  VL 2003»
14 years 3 months ago
A reading algorithm for constraint diagrams
Constraint diagrams are a visual notation designed to complement the Unified Modeling Language in the development of software systems. They generalize Venn diagrams and Euler cir...
Andrew Fish, Jean Flower, John Howse
COCOON
2009
Springer
14 years 4 months ago
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
GIS
2007
ACM
14 years 1 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
EDBT
2008
ACM
167views Database» more  EDBT 2008»
14 years 10 months ago
HISSCLU: a hierarchical density-based method for semi-supervised clustering
In situations where class labels are known for a part of the objects, a cluster analysis respecting this information, i.e. semi-supervised clustering, can give insight into the cl...
Christian Böhm, Claudia Plant
FCT
2009
Springer
14 years 4 months ago
On Random Betweenness Constraints
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially di...
Andreas Goerdt