1327 search results - page 89 / 266 » Path following algorithm for the graph matching problem |
141
click to vote
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
A graph-based framework for dynamic fractional frequency reuse (FFR) in multi-cell OFDMA networks is proposed in this work. FFR is a promising resource allocation technique that c...
127
Voted
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
143
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
122
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
182
Voted
ICNP
2002
IEEE
15 years 8 months ago
2002
IEEE
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...