Sciweavers

4536 search results - page 6 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
BIBM
2009
IEEE
190views Bioinformatics» more  BIBM 2009»
13 years 5 months ago
A Fast, Semi-automatic Brain Structure Segmentation Algorithm for Magnetic Resonance Imaging
Abstract--Medical image segmentation has become an essential technique in clinical and research-oriented applications. Because manual segmentation methods are tedious, and fully au...
Kevin Karsch, Qing He, Ye Duan
INFORMATICALT
2002
82views more  INFORMATICALT 2002»
13 years 7 months ago
Data Aggregation Sets in Adaptive Data Model
This article presents the ways of identification, selection and transformation of the data into other structures. Relation selection and transformation may change data quantity and...
Petras Gailutis Adomenas, Algirdas Ciucelis
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
13 years 7 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
TGIS
2010
86views more  TGIS 2010»
13 years 2 months ago
A Road Network Selection Process Based on Data Enrichment and Structure Detection
The presented paper deals with a generic process for road network selection based on data enrichment and structure detection. The first step is to detect significant structures and...
Guillaume Touya
TCAD
1998
161views more  TCAD 1998»
13 years 7 months ago
Ordered Kronecker functional decision diagrams-a data structure for representation and manipulation of Boolean functions
— Ordered Kronecker functional decision diagrams (OKFDD’s) are a data structure for efficient representation and manipulation of Boolean functions. OKFDD’s are a generalizat...
Rolf Drechsler, Bernd Becker