50 search results - page 6 / 10 » Dynamic Programming and Fast Matrix Multiplication |
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
OOPSLA
1997
Springer
13 years 11 months ago
1997
Springer
A type inclusion test determines whether one type is a subtype of another. Efficient type testing techniques exist for single subtyping, but not for languages with multiple subtyp...
CIMAGING
2010
13 years 8 months ago
2010
We have studied a camera with a very large number of binary pixels referred to as the gigavision camera [1] or the gigapixel digital film camera [2, 3]. Potential advantages of th...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
Modern network processors support high levels of parallelism in packet processing by supporting multiple threads that execute on a micro-engine. Threads switch context upon encoun...
BMCBI
2011
12 years 11 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...