Sciweavers

11212 search results - page 268 / 2243
» Semi-persistent Data Structures
Sort
View
WDAG
2004
Springer
88views Algorithms» more  WDAG 2004»
15 years 12 months ago
Nonblocking Concurrent Data Structures with Condition Synchronization
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...
William N. Scherer III, Michael L. Scott
ICPR
2002
IEEE
16 years 7 months ago
Fusion of Range and Visual Data for the Extraction of Scene Structure Information
In this paper, a method for inferring 3D structure information based on both range and visual data is proposed. Data fusion is achieved by validating assumptions formed according ...
Haris Baltzakis, Antonis A. Argyros, Panos E. Trah...
IV
2003
IEEE
98views Visualization» more  IV 2003»
15 years 12 months ago
The Stardinates - Visualizing Highly Structured Data
The Stardinates are a novel interactive Information Visualization (InfoVis) technique which aims at visualizing highly structured data. They represent some Gestalt principles very...
Monika Lanzenberger, Silvia Miksch, Margit Pohl
VLSID
2000
IEEE
94views VLSI» more  VLSID 2000»
15 years 11 months ago
A Genetic Algorithm for the Synthesis of Structured Data Paths
The technique presented here achieves simultaneous optimization of schedule time and data path component cost within a structured data path architecture, using a genetic algorithm...
Chittaranjan A. Mandal, R. M. Zimmer
SOFSEM
2005
Springer
16 years 1 days ago
RAQ: A Range-Queriable Distributed Data Structure
Different structures are used in peer-to-peer networks to represent their inherently distributed, self-organized and decentralized memory structure. In this paper, a simple range...
Hamid Nazerzadeh, Mohammad Ghodsi