Sciweavers

1095 search results - page 48 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
PPSN
2000
Springer
15 years 5 months ago
Competitive Segmentation: A Struggle for Image Space
In this paper, we propose a competitive image segmentation algorithm. It is a dynamic evolving optimization method, which we call the population algorithm. The method is inspired f...
Cor J. Veenman, Marcel J. T. Reinders, Eric Backer
133
Voted
CLUSTER
2000
IEEE
15 years 6 months ago
Distributed Processor Allocation in Multicomputers
Current processor allocation techniques for multicomputers are based on centralized front-end based algorithms. As a result, the applied strategies are usually restricted to stati...
Rose Rose, Hans-Ulrich Heiss, Philippe Olivier Ale...
118
Voted
SPAA
2010
ACM
15 years 7 months ago
Towards optimizing energy costs of algorithms for shared memory architectures
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
Vijay Anand Korthikanti, Gul Agha
110
Voted
ASAP
2008
IEEE
82views Hardware» more  ASAP 2008»
15 years 8 months ago
Run-time thread sorting to expose data-level parallelism
We address the problem of data parallel processing for computational quantum chemistry (CQC). CQC is a computationally demanding tool to study the electronic structure of molecule...
Tirath Ramdas, Gregory K. Egan, David Abramson, Ki...
DC
2011
14 years 2 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young