874 search results - page 141 / 175 » Graph Transformation in a Nutshell |
134
Voted
JACM
2007
15 years 3 months ago
2007
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
125
Voted
CORR
2010
Springer
15 years 7 days ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
156
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
141
Voted
WSDM
2009
ACM
15 years 10 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
143
click to vote
AICCSA
2007
IEEE
15 years 10 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...