23 search results - page 2 / 5 » Near-Optimal Sublinear Time Algorithms for Ulam Distance |
CORR
2010
Springer
13 years 14 days ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
JACM
2006
13 years 5 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...