Sciweavers

977 search results - page 60 / 196
» Permuting Web Graphs
Sort
View
JCT
2010
87views more  JCT 2010»
14 years 10 months ago
Bijections between pattern-avoiding fillings of Young diagrams
The pattern-avoiding fillings of Young diagrams we study arose from Postnikov’s work on positive Grassman cells. They are called Γ -diagrams, and are in bijection with decorate...
Matthieu Josuat-Vergès
COLT
2010
Springer
14 years 10 months ago
Hedging Structured Concepts
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
Wouter M. Koolen, Manfred K. Warmuth, Jyrki Kivine...
SIAMJO
2010
110views more  SIAMJO 2010»
14 years 6 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
PVLDB
2010
110views more  PVLDB 2010»
14 years 10 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...
ICCS
2010
Springer
14 years 10 months ago
Translations between RDF(S) and Conceptual Graphs
Though similarities between the Semantic Web language RDF(S) and languages of the Conceptual Graphs family have often been pointed out, the differences between these formalisms hav...
Jean-François Baget, Madalina Croitoru, Ala...