Sciweavers

294 search results - page 46 / 59
» Indexing Large Trajectory Data Sets With SETI
Sort
View
SIGIR
1992
ACM
13 years 11 months ago
A Faster Algorithm for Constructing Minimal Perfect Hash Functions
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
Edward A. Fox, Qi Fan Chen, Lenwood S. Heath
BMCBI
2006
145views more  BMCBI 2006»
13 years 7 months ago
Querying the public databases for sequences using complex keywords contained in the feature lines
Background: High throughput technologies often require the retrieval of large data sets of sequences. Retrieval of EMBL or GenBank entries using keywords is easy using tools such ...
Olivier Croce, Michaël Lamarre, Richard Chris...
VLDB
2004
ACM
227views Database» more  VLDB 2004»
14 years 1 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
BMCBI
2011
13 years 2 months ago
A theoretical entropy score as a single value to express inhibitor selectivity
Background: Designing maximally selective ligands that act on individual targets is the dominant paradigm in drug discovery. Poor selectivity can underlie toxicity and side effect...
Joost C. M. Uitdehaag, Guido J. R. Zaman
DASFAA
2008
IEEE
190views Database» more  DASFAA 2008»
14 years 2 months ago
Analysis of Time Series Using Compact Model-Based Descriptions
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...