4908 search results - page 963 / 982 » On the Complexity of Optimal K-Anonymity |
90
Voted
BMCBI
2008
14 years 12 months ago
2008
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
CGF
2010
14 years 12 months ago
2010
We present physically based algorithms for interactive deformable shape and motion modeling. We coarsely sample the objects with simulation nodes, and apply a meshless finite elem...
104
click to vote
COMGEO
2010
ACM
14 years 12 months ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
CGF
2008
14 years 12 months ago
2008
Teaser Figure: Left: Brain, visualized using silhouettes, the lesion's spatial depth is displayed using a ring. Center: Combined rendering of brain tissue, skull and fiber tr...
108
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
r of Abstraction (invited lecture) . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Barbara Liskov Fast Asynchronous Consensus with Optimal Resilience. . . . . . . . . . . ....