Sciweavers

580 search results - page 44 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
PLDI
2012
ACM
11 years 10 months ago
Scalable and precise dynamic datarace detection for structured parallelism
Existing dynamic race detectors suffer from at least one of the following three limitations: (i) space overhead per memory location grows linearly with the number of parallel thre...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
ICIP
2006
IEEE
14 years 9 months ago
Developing an Efficient Region Growing Engine for Image Segmentation
Image segmentation is a crucial part of image processing applications. Currently available approaches require significant computer power to handle large images. We present an effi...
Emanuel Gofman
COMPGEOM
2003
ACM
14 years 1 months ago
Incremental constructions con BRIO
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
Nina Amenta, Sunghee Choi, Günter Rote
EOR
2007
87views more  EOR 2007»
13 years 7 months ago
An optimal and scalable parallelization of the two-list
In this paper, we suggest a parallel algorithm based on a shared memory SIMD architecture for solving an n item subset-sum problem in time O(2n/2 /p) by using p = 2q processors, 0...
Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma,...
ECBS
2006
IEEE
211views Hardware» more  ECBS 2006»
14 years 1 months ago
Modified Pseudo LRU Replacement Algorithm
Although the LRU replacement algorithm has been widely used in cache memory management, it is wellknown for its inability to be easily implemented in hardware. Most of primary cac...
Hassan Ghasemzadeh, Sepideh Sepideh Mazrouee, Moha...