2124 search results - page 144 / 425 » Repairing Structurally Complex Data |
VLDB
1993
ACM
14 years 2 months ago
1993
ACM
Object-oriented databases are a recent and important development and many studies of them have been performed. These consider aspects such as data modeling, query languages, perfo...
PODC
2010
ACM
14 years 23 days ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
JSA
2006
13 years 10 months ago
2006
This paper proposes a new concurrent data structure, called parallel hash table, for synchronizing the access of multiple threads to resources stored in a shared buffer. We prove ...
JACM
2000
13 years 10 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
ANSS
2006
IEEE
14 years 4 months ago
2006
IEEE
— Computer simulations of complex systems such as physical aggregation processes or swarming and collective behaviour of life-forms, often require order N-squared computational c...