6315 search results - page 260 / 1263 » Approximating Solution Structure |
178
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
202
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
170
Voted
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— In this paper we consider several problems involving control with limited actuation and sampling rates. Event-based control has emerged as an attractive approach for ad...
157
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
249
click to vote
MST
2010
15 years 1 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...