2489 search results - page 49 / 498 » On the Subgroup Distance Problem |
114
click to vote
IJCV
2007
15 years 3 months ago
2007
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
136
click to vote
CIAC
1997
Springer
15 years 7 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
152
click to vote
PODC
2005
ACM
15 years 9 months ago
2005
ACM
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
121
Voted
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a sim...
118
click to vote
CAD
2006
Springer
15 years 3 months ago
2006
Springer
Traditional mesh-based approaches to the modeling and analysis of physical fields within geometric models require some form of topological reconstruction and conversion in the mes...