Sciweavers

559 search results - page 48 / 112
» Algorithms and Data Structures for External Memory
Sort
View
TMM
2002
130views more  TMM 2002»
15 years 2 months ago
Computable scenes and structures in films
In this paper, we present a computational scene model and also derive novel algorithms for computing audio and visual scenes and within-scene structures in films. We use constraint...
Hari Sundaram, Shih-Fu Chang
125
Voted
ICPP
2009
IEEE
15 years 6 days ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun
OOPSLA
2005
Springer
15 years 8 months ago
Lifting sequential graph algorithms for distributed-memory parallel computation
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
Douglas Gregor, Andrew Lumsdaine
ISLPED
1998
ACM
84views Hardware» more  ISLPED 1998»
15 years 6 months ago
Low power architecture of the soft-output Viterbi algorithm
CT This paper investigates the low power implementation issues of the soft-output Viterbi algorithm (SOVA), a building block for turbo codes. By briefly explaining the theory of t...
David Garrett, Mircea R. Stan
DAC
2003
ACM
16 years 3 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li