Sciweavers

64 search results - page 8 / 13
» Towards an Analysis of Range Query Performance in Spatial Da...
Sort
View
BMCBI
2008
103views more  BMCBI 2008»
13 years 7 months ago
Parameter estimation for robust HMM analysis of ChIP-chip data
Background: Tiling arrays are an important tool for the study of transcriptional activity, proteinDNA interactions and chromatin structure on a genome-wide scale at high resolutio...
Peter Humburg, David Bulger, Glenn Stone
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 3 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
GIS
2008
ACM
13 years 8 months ago
Snapshot location-based query processing on moving objects in road networks
Location-based services are increasingly popular and it is a key challenge to efficiently support query processing. We present a novel design to process large numbers of location...
Haojun Wang, Roger Zimmermann
IJCSA
2008
237views more  IJCSA 2008»
13 years 7 months ago
Development of A SOLAP Patrimony Management Application System: Fez Medina as a Case Study
It is well known that transactional and analytical systems each require different database architecture. In general, the database structure of transactional systems is optimized f...
I. Salam, M. El Mohajir, A. Taleb, B. El Mohajir
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
13 years 11 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....