1576 search results - page 211 / 316 » Streaming Algorithms for Independent Sets |
149
click to vote
COCO
2004
Springer
15 years 8 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
156
Voted
DEXA
2008
Springer
15 years 6 months ago
2008
Springer
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
146
Voted
WDAG
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
164
click to vote
SODA
1993
ACM
15 years 6 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
124
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
In this paper we propose an extension to the standard Markov Random Field (MRF) model in order to handle layers. Our extension, which we call a Factorial MRF (FMRF), is analogous t...