4908 search results - page 898 / 982 » On the Complexity of Optimal K-Anonymity |
BMCBI
2007
14 years 12 months ago
2007
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
110
click to vote
DAM
2008
14 years 12 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
132
click to vote
DCG
2008
14 years 12 months ago
2008
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
118
click to vote
BMCBI
2006
14 years 12 months ago
2006
Background: The modeling of dynamic systems requires estimating kinetic parameters from experimentally measured time-courses. Conventional global optimization methods used for par...