Sciweavers

124 search results - page 13 / 25
» The Cell Probe Complexity of Succinct Data Structures
Sort
View
TVCG
2010
188views more  TVCG 2010»
13 years 6 months ago
Analyzing and Tracking Burning Structures in Lean Premixed Hydrogen Flames
— This paper presents topology-based methods to robustly extract, analyze, and track features defined as subsets of isosurfaces. First, we demonstrate how features identified b...
Peer-Timo Bremer, Gunther H. Weber, Valerio Pascuc...
BMCBI
2007
130views more  BMCBI 2007»
13 years 7 months ago
Differential analysis for high density tiling microarray data
Background: High density oligonucleotide tiling arrays are an effective and powerful platform for conducting unbiased genome-wide studies. The ab initio probe selection method emp...
Srinka Ghosh, Heather A. Hirsch, Edward A. Sekinge...
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
BMCBI
2010
102views more  BMCBI 2010»
13 years 7 months ago
SAMPLEX: Automatic mapping of perturbed and unperturbed regions of proteins and complexes
Background: The activity of proteins within the cell is characterized by their motions, flexibility, interactions or even the particularly intriguing case of partially unfolded st...
Mickaël Krzeminski, Karine Loth, Rolf Boelens...
SIAMSC
2011
85views more  SIAMSC 2011»
12 years 10 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss