Sciweavers

405 search results - page 74 / 81
» A Parallel Priority Data Structure with Applications
Sort
View
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
15 years 5 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
VISUALIZATION
2003
IEEE
15 years 4 months ago
Fast Volume Segmentation With Simultaneous Visualization Using Programmable Graphics Hardware
Segmentation of structures from measured volume data, such as anatomy in medical imaging, is a challenging data-dependent task. In this paper, we present a segmentation method tha...
Anthony Sherbondy, Michael Houston, Sandy Napel
IEEEVAST
2010
14 years 6 months ago
Improving the visual analysis of high-dimensional datasets using quality measures
Modern visualization methods are needed to cope with very highdimensional data. Efficient visual analytical techniques are required to extract the information content in these dat...
Georgia Albuquerque, Martin Eisemann, Dirk J. Lehm...
PODC
2004
ACM
15 years 5 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
BMCBI
2006
118views more  BMCBI 2006»
14 years 11 months ago
Exploration of biological network centralities with CentiBiN
Background: The elucidation of whole-cell regulatory, metabolic, interaction and other biological networks generates the need for a meaningful ranking of network elements. Central...
Björn H. Junker, Dirk Koschützki, Falk S...