Sciweavers

15 search results - page 2 / 3
» The crossing number of a projective graph is quadratic in th...
Sort
View
JMLR
2006
125views more  JMLR 2006»
13 years 5 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 18 days ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
APVIS
2006
13 years 7 months ago
Visualizing multivariate network on the surface of a sphere
A multivariate network is a graph whose nodes contain multi-dimensional attributes. We propose a method to visualize such a network using spherical Self-Organizing Map (SOM) and c...
Yingxin Wu, Masahiro Takatsuka
AI
2010
Springer
13 years 5 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
SMI
2010
IEEE
120views Image Analysis» more  SMI 2010»
13 years 4 months ago
Single-Cycle Plain-Woven Objects
—It has recently been shown that if we twist an arbitrary subset of edges of a mesh on an orientable surface, the resulting extended graph rotation system (EGRS) can be used to i...
Qing Xing, Ergun Akleman, Jianer Chen, Jonathan L....