Sciweavers

2680 search results - page 536 / 536
» The topology of the independence complex
Sort
View
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 11 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
13 years 12 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
BMCBI
2010
98views more  BMCBI 2010»
13 years 11 months ago
miRMaid: a unified programming interface for microRNA data resources
Background: MicroRNAs (miRNAs) are endogenous small RNAs that play a key role in post-transcriptional regulation of gene expression in animals and plants. The number of known miRN...
Anders Jacobsen, Anders Krogh, Sakari Kauppinen, M...
BMCBI
2007
167views more  BMCBI 2007»
13 years 10 months ago
AlzPharm: integration of neurodegeneration data using RDF
Background: Neuroscientists often need to access a wide range of data sets distributed over the Internet. These data sets, however, are typically neither integrated nor interopera...
Hugo Y. K. Lam, Luis N. Marenco, Tim Clark, Yong G...
BMCBI
2005
108views more  BMCBI 2005»
13 years 10 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer