Sciweavers

11213 search results - page 259 / 2243
» Low-contention data structures
Sort
View
MA
2010
Springer
153views Communications» more  MA 2010»
15 years 4 months ago
Testing quasi-independence for truncation data
Quasi-independence is a common assumption for analyzing truncated data. To verify this condition, we consider a class of weighted log-rank type statistics that include existing te...
Takeshi Emura, Weijing Wang
NAR
2011
203views Computer Vision» more  NAR 2011»
14 years 8 months ago
Laminin database: a tool to retrieve high-throughput and curated data for studies on laminins
The Laminin(LM)-database, hosted at http://www .lm.lncc.br, is the first database focusing a noncollagenous extracellular matrix protein family, the LMs. Part of the knowledge ava...
Daiane C. F. Golbert, Leandra Linhares-Lacerda, Lu...
COMPGEOM
2004
ACM
15 years 11 months ago
Time-varying reeb graphs for continuous space-time data
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
Herbert Edelsbrunner, John Harer, Ajith Mascarenha...
SSD
1995
Springer
84views Database» more  SSD 1995»
15 years 9 months ago
Lossless Representation of Topological Spatial Data
We present a data structure used to represent planar spatial databases in the topological data model. Conceptually, such databases consist of points, lines between these points, an...
Bart Kuijpers, Jan Paredaens, Jan Van den Bussche
ICDM
2003
IEEE
138views Data Mining» more  ICDM 2003»
15 years 10 months ago
PixelMaps: A New Visual Data Mining Approach for Analyzing Large Spatial Data Sets
PixelMaps are a new pixel-oriented visual data mining technique for large spatial datasets. They combine kerneldensity-based clustering with pixel-oriented displays to emphasize c...
Daniel A. Keim, Christian Panse, Mike Sips, Stephe...