Sciweavers

535 search results - page 65 / 107
» Insertion and Expansion Operations for
Sort
View
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
16 years 5 days ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
15 years 6 months ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 3 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
AFRIGRAPH
2010
ACM
15 years 3 months ago
Progressive RBF interpolation
Interpolation based on Radial Basis Functions (RBF) is very often used for scattered scalar data interpolation in n-dimensional space in general. RBFs are used for surface reconst...
Václav Skala
ASWC
2008
Springer
15 years 1 months ago
Efficient Index Maintenance for Frequently Updated Semantic Data
Abstract. Nowadays, the demand on querying and searching the Semantic Web is increasing. Some systems have adopted IR (Information Retrieval) approaches to index and search the Sem...
Yan Liang, Haofen Wang, Qiaoling Liu, Thanh Tran, ...