Sciweavers

11212 search results - page 328 / 2243
» Semi-persistent Data Structures
Sort
View
NAR
1998
161views more  NAR 1998»
15 years 6 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
JMLR
2006
125views more  JMLR 2006»
15 years 6 months ago
A Linear Non-Gaussian Acyclic Model for Causal Discovery
In recent years, several methods have been proposed for the discovery of causal structure from non-experimental data. Such methods make various assumptions on the data generating ...
Shohei Shimizu, Patrik O. Hoyer, Aapo Hyvärin...
SAC
2002
ACM
15 years 6 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...
ISASSCI
2001
15 years 8 months ago
Data Mining Architectures - A Comparative Study
Data mining is the process of deriving knowledge from data. The architecture of a data mining system plays a significant role in the efficiency with which data is mined. It is pro...
Thomas Thomas, Sanjeev Jayakumar, B. Muthukumaran
TON
2010
176views more  TON 2010»
15 years 1 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