Sciweavers

5005 search results - page 311 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
156
Voted
TIP
2008
175views more  TIP 2008»
15 years 4 months ago
Algorithmic and Architectural Optimizations for Computationally Efficient Particle Filtering
Abstract--In this paper, we analyze the computational challenges in implementing particle filtering, especially to video sequences. Particle filtering is a technique used for filte...
Aswin C. Sankaranarayanan, Ankur Srivastava, Rama ...
124
Voted
IEEEHPCS
2010
15 years 3 months ago
An experimental study of greedy routing algorithms
The “small world” phenomenon, i.e., the fact that the global social network is strongly connected in the sense that every two persons are inter-related through a small chain o...
Stavros Athanassopoulos, Christos Kaklamanis, Ilia...
157
Voted
ICPPW
2002
IEEE
15 years 9 months ago
ARA - The Ant-Colony Based Routing Algorithm for MANETs
A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kind of networks are very flexible, thus they do not require any existing infr...
Mesut Günes, Udo Sorges, Imed Bouazizi
HIPC
2009
Springer
15 years 2 months ago
Detailed analysis of I/O traces for large scale applications
- In this paper, we present a tool to extract I/O traces from very large applications running at full scale during their production runs. We analyze these traces to gain informatio...
Nithin Nakka, Alok N. Choudhary, Wei-keng Liao, Le...
SDM
2012
SIAM
297views Data Mining» more  SDM 2012»
13 years 7 months ago
A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis
The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on supercomputers using a high-level language without grappling with the ...
Adam Lugowski, David M. Alber, Aydin Buluç,...