Sciweavers

4542 search results - page 227 / 909
» Design patterns for data structures
Sort
View
BMCBI
2006
120views more  BMCBI 2006»
15 years 6 months ago
Integrating protein structures and precomputed genealogies in the Magnum database: Examples with cellular retinoid binding prote
Background: When accurate models for the divergent evolution of protein sequences are integrated with complementary biological information, such as folded protein structures, anal...
Michael E. Bradley, Steven A. Benner
VLDB
1990
ACM
166views Database» more  VLDB 1990»
15 years 10 months ago
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
In this paper, we present an efficient algorithm for managing replicated data. We impose a logical tree structure on the set of copies of an object. In a failurefree environment t...
Divyakant Agrawal, Amr El Abbadi
COMCOM
2002
124views more  COMCOM 2002»
15 years 6 months ago
Thin-client Web access patterns: Measurements from a cache-busting proxy
This paper describes a new technique for measuring Web client request patterns and analyzes a large client trace collected using the new method. In this approach a modified proxy ...
Terence Kelly
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
16 years 6 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
AIEDAM
2007
191views more  AIEDAM 2007»
15 years 6 months ago
Ontology-based design information extraction and retrieval
Because of the increasing complexity of products and the design process, as well as the popularity of computer-aided documentation tools, the number of electronic and textual desi...
Zhanjun Li, Karthik Ramani