Sciweavers

4542 search results - page 160 / 909
» Design patterns for data structures
Sort
View
ICDE
2005
IEEE
149views Database» more  ICDE 2005»
16 years 6 months ago
Change Tolerant Indexing for Constantly Evolving Data
Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typica...
Reynold Cheng, Yuni Xia, Sunil Prabhakar, Rahul Sh...
142
Voted
IFIP
2004
Springer
15 years 10 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
KDD
1995
ACM
95views Data Mining» more  KDD 1995»
15 years 8 months ago
On Subjective Measures of Interestingness in Knowledge Discovery
One of the central problems in the field of knowledge discovery is the development of good measures of interestingness of discovered patterns. Such measures of interestingness are...
Abraham Silberschatz, Alexander Tuzhilin
ENTCS
2008
116views more  ENTCS 2008»
15 years 5 months ago
Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
Michele Baggi, Demis Ballis
DATASCIENCE
2002
53views more  DATASCIENCE 2002»
15 years 4 months ago
An Integrated Receptor Database (IRDB)
Various receptor data were collected, edited and integrated into an Integrated Receptor Database (IRDB). The data stored includes structural data (amino acid sequences, their seco...
Kotoko Nakata, Takako Takai-Igarashi, Tatsuya Naka...