5105 search results - page 170 / 1021 » Approximate Structural Consistency |
137
click to vote
COMPGEOM
2009
ACM
15 years 10 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...
135
click to vote
JCO
2011
14 years 10 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
119
click to vote
ICMS
2010
15 years 2 months ago
2010
This paper presents a computational framework that allows for a robust extraction of the extremal structure of scalar and vector fields on 2D manifolds embedded in 3D. This struct...
155
click to vote
RECOMB
2006
Springer
16 years 4 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 ...
169
Voted
WSS
2001
15 years 5 months ago
2001
Abstract. A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to...