1095 search results - page 23 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
ICPP
1996
IEEE
13 years 11 months ago
1996
IEEE
: We study the scalability of 2-D discrete wavelet transform algorithms on fine-grained parallel architectures. The principal operation in the 2-D DWT is the filtering operation us...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
We present an algorithm for on-line, incremental discovery of temporal-difference (TD) networks. The key contribution is the establishment of three criteria to expand a node in TD...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...