7978 search results - page 326 / 1596 » Representation before computation |
180
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
212
click to vote
ICS
1993
Tsinghua U.
15 years 10 months ago
1993
Tsinghua U.
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
239
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: The ability to search for and precisely compare similar phenotypic appearances within and across species has vast potential in plant science and genetic research. The ...
186
click to vote
ICSE
2004
IEEE-ACM
16 years 6 months ago
2004
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
172
click to vote
LCPC
2005
Springer
16 years 6 days ago
2005
Springer
We briefly introduce the notion of Semantically Enhanced Library Languages, SELL, as a practical and economical alternative to special-purpose programming languages for high-perfo...