1632 search results - page 29 / 327 » Sublinear Time Algorithms for Metric Space Problems |
115
click to vote
STOC
2010
ACM
16 years 21 days ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
130
Voted
RECOMB
2006
Springer
16 years 3 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
120
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
130
click to vote
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which...