Sciweavers

11214 search results - page 178 / 2243
» Just-in-time data structures
Sort
View
ISI
2008
Springer
13 years 10 months ago
A framework for privacy-preserving cluster analysis
Abstract--Releasing person-specific data could potentially reveal sensitive information of individuals. k-anonymization is a promising privacy protection mechanism in data publishi...
Benjamin C. M. Fung, Ke Wang, Lingyu Wang, Mourad ...
BMCBI
2006
159views more  BMCBI 2006»
13 years 10 months ago
Prediction of protein continuum secondary structure with probabilistic models based on NMR solved structures
Background: The structure of proteins may change as a result of the inherent flexibility of some protein regions. We develop and explore probabilistic machine learning methods for...
Mikael Bodén, Zheng Yuan, Timothy L. Bailey
NAR
1998
161views more  NAR 1998»
13 years 10 months ago
Touring protein fold space with Dali/FSSP
The FSSP database and its new supplement, the Dali Domain Dictionary, present a continuously updated classification of all known 3D protein structures. The classification is deriv...
Liisa Holm, Chris Sander
SAC
2002
ACM
13 years 10 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
TON
2010
176views more  TON 2010»
13 years 5 months ago
Approximation of Generalized Processor Sharing With Interleaved Stratified Timer Wheels
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
Martin Karsten