Sciweavers

316 search results - page 36 / 64
» Bounded Depth Data Trees
Sort
View
COMPGEOM
2010
ACM
14 years 2 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
BMCBI
2007
136views more  BMCBI 2007»
13 years 9 months ago
Prediction of tissue-specific cis-regulatory modules using Bayesian networks and regression trees
Background: In vertebrates, a large part of gene transcriptional regulation is operated by cisregulatory modules. These modules are believed to be regulating much of the tissue-sp...
Xiaoyu Chen, Mathieu Blanchette
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 9 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
COMPGEOM
2010
ACM
14 years 2 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
MOBISYS
2004
ACM
14 years 8 months ago
Exponential Index: A Parameterized Distributed Indexing Scheme for Data on Air
Wireless data broadcast has received a lot of attention from industries and academia in recent years. Access efficiency and energy conservation are two critical performance concer...
Jianliang Xu, Wang-Chien Lee, Xueyan Tang