121 search results - page 13 / 25 » Approximating Maximum Weight Matching in Near-Linear Time |
179
click to vote
STOC
2005
ACM
15 years 11 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
156
click to vote
ECML
2006
Springer
15 years 7 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
151
Voted
ICTCS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
164
click to vote
ISPAN
1997
IEEE
15 years 10 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
137
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...