Sciweavers

32545 search results - page 109 / 6509
» Data Structures and Algorithms
Sort
View
142
Voted
ICPP
2008
IEEE
15 years 9 months ago
Mapping Algorithms for Multiprocessor Tasks on Multi-Core Clusters
In this paper, we explore the use of hierarchically structured multiprocessor tasks (M-tasks) for programming multi-core cluster systems. These systems often have hierarchically s...
Jörg Dümmler, Thomas Rauber, Gudula R&uu...
162
Voted
JPDC
2006
111views more  JPDC 2006»
15 years 2 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader
179
Voted
AINA
2009
IEEE
15 years 9 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
143
Voted
ADBIS
1994
Springer
87views Database» more  ADBIS 1994»
15 years 6 months ago
Variations of R-Tree Structure for Indexing of Spatial Objects
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
M. G. Martynov
113
Voted
MM
2000
ACM
98views Multimedia» more  MM 2000»
15 years 7 months ago
Determining computable scenes in films and their structures using audio-visual memory models
In this paper we present novel algorithms for computing scenes and within-scene structures in films. We begin by mapping insights from film-making rules and experimental results f...
Hari Sundaram, Shih-Fu Chang