Sciweavers

12453 search results - page 11 / 2491
» Concurrent Data Structures
Sort
View
ISMIR
2003
Springer
154views Music» more  ISMIR 2003»
15 years 5 months ago
Position Indexing of Adjacent and Concurrent N-Grams for Polyphonic Music Retrieval
In this paper we examine the retrieval performance of adjacent and concurrent n-grams generated from polyphonic music data. We deploy a method to index polyphonic music using a wo...
Shyamala Doraisamy, Stefan M. Rüger
EDCC
2005
Springer
15 years 5 months ago
Efficient Single-Pattern Fault Simulation on Structurally Synthesized BDDs
Abstract. Current paper proposes an efficient alternative for traditional gatelevel fault simulation. The authors explain how Structurally Synthesized Binary Decision Diagrams (SSB...
Jaan Raik, Raimund Ubar, Sergei Devadze, Artur Jut...
ISCA
1993
IEEE
137views Hardware» more  ISCA 1993»
15 years 4 months ago
Transactional Memory: Architectural Support for Lock-Free Data Structures
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...
Maurice Herlihy, J. Eliot B. Moss
DAWAK
2006
Springer
15 years 3 months ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
FLAIRS
2004
15 years 1 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels