Sciweavers

EMMCVPR
2011
Springer
12 years 4 months ago
SlimCuts: GraphCuts for High Resolution Images Using Graph Reduction
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...
Björn Scheuermann, Bodo Rosenhahn
CC
2011
Springer
267views System Software» more  CC 2011»
12 years 8 months ago
Using Disjoint Reachability for Parallelization
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
James Christopher Jenista, Yong Hun Eom, Brian Dem...
CORR
2011
Springer
128views Education» more  CORR 2011»
12 years 11 months ago
Load Balancing in a Networked Environment through Homogenization
Distributed processing across a networked environment suffers from unpredictable behavior of speedup due to heterogeneous nature of the hardware and software in the remote machine...
M. Shahriar Hossain, M. Muztaba Fuad, Debzani Deb,...
IPPS
2010
IEEE
13 years 1 months ago
Prototype for a large-scale static timing analyzer running on an IBM Blue Gene
This paper focuses on parallelization of the classic static timing analysis (STA) algorithm for verifying timing characteristics of digital integrated circuits. Given ever-increasi...
Akintayo Holder, Christopher D. Carothers, Kerim K...
ICDM
2010
IEEE
276views Data Mining» more  ICDM 2010»
13 years 2 months ago
Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs
Many time series data mining problems require subsequence similarity search as a subroutine. While this can be performed with any distance measure, and dozens of distance measures ...
Doruk Sart, Abdullah Mueen, Walid A. Najjar, Eamon...
IPL
2002
65views more  IPL 2002»
13 years 4 months ago
Parallel evolutionary algorithms can achieve super-linear performance
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
Enrique Alba
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 4 months ago
Network Coding for Speedup in Switches
We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence betwe...
MinJi Kim, Jay Kumar Sundararajan, Muriel Mé...
IPPS
1994
IEEE
13 years 8 months ago
Shared Virtual Memory and Generalized Speedup
Generalized speedup is de ned as parallel speed over sequential speed. In this paper the generalized speedup and its relation with other existing performance metrics, such as trad...
Xian-He Sun, Jianping Zhu
HPCA
1998
IEEE
13 years 8 months ago
FPGA Based Custom Computing Machines for Irregular Problems
Over the past few years there has been increased interest in building custom computing machines (CCMs) as a way of achieving very high performance on specific problems. The advent...
David Abramson, Paul Logothetis, Adam Postula, Mar...
ISCC
2003
IEEE
13 years 9 months ago
Pipelined Maximal Size Matching Scheduling Algorithms for CIOQ Switches.
In this paper, we propose new pipelined request-grant-accept (RGA) and request-grant (RG) maximal size matching (MSM) algorithms to achieve speedup in combined input and output qu...
Mei Yang, Si-Qing Zheng