Sciweavers

958 search results - page 35 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
112
Voted
SSDBM
2007
IEEE
107views Database» more  SSDBM 2007»
15 years 6 months ago
Efficient Evaluation of Inbreeding Queries on Pedigree Data
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
Brendan Elliott, Suleyman Fatih Akgul, Stephen May...
ICDE
2006
IEEE
194views Database» more  ICDE 2006»
16 years 1 months ago
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying meas...
Alexey Pryakhin, Christian Böhm, Matthias Sch...
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
16 years 18 days ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan
EUROCAST
2007
Springer
108views Hardware» more  EUROCAST 2007»
15 years 4 months ago
Pattern-Based Verification for Trees
Abstract. Pattern-based verification trying to abstract away the concrete number of repeated memory structures is one of the approaches that have recently been proposed for verific...
Milan Ceska, Pavel Erlebach, Tomás Vojnar
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
15 years 7 months ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....