4469 search results - page 765 / 894 » Dynamic Program Slicing |
ALENEX
2007
14 years 11 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
103
Voted
BIOCOMP
2007
14 years 11 months ago
2007
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ...
DATESO
2007
14 years 11 months ago
2007
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
81
Voted
ICWS
2008
IEEE
14 years 11 months ago
2008
IEEE
Web service applications integrate explicit client-service interactions with notification-style programming. Such event-driven interactions are often called implicit invocations b...
105
Voted
IJCAI
2007
14 years 11 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...