Sciweavers

1994 search results - page 241 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
TCS
2008
14 years 10 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
EMSOFT
2005
Springer
15 years 3 months ago
AutoDVS: an automatic, general-purpose, dynamic clock scheduling system for hand-held devices
We present AutoDVS, a dynamic voltage scaling (DVS) system for hand-held computers. Unlike extant DVS systems, AutoDVS distinguishes common, course-grain, program behavior and cou...
Selim Gurun, Chandra Krintz
PPOPP
2011
ACM
14 years 26 days ago
GRace: a low-overhead mechanism for detecting data races in GPU programs
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
Mai Zheng, Vignesh T. Ravi, Feng Qin, Gagan Agrawa...
CASCON
2006
119views Education» more  CASCON 2006»
14 years 11 months ago
Static analysis for dynamic coupling measures
Coupling measures have important applications in software development and maintenance. They are used to reason about the structural complexity of software and have been shown to p...
Yin Liu, Ana Milanova
WOSP
1998
ACM
15 years 2 months ago
Poems: end-to-end performance design of large parallel adaptive computational systems
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
Ewa Deelman, Aditya Dube, Adolfy Hoisie, Yong Luo,...