28 search results - page 5 / 6 » Dynamic programming and minimum risk paths |
HPDC
2005
IEEE
13 years 10 months ago
2005
IEEE
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
SIGSOFT
2010
ACM
12 years 11 months ago
2010
ACM
Although a number of automatic tools have been developed to detect faults, much of the diagnosis is still being done manually. To help with the diagnostic tasks, we formally intro...
INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
ICDAR
2011
IEEE
12 years 4 months ago
2011
IEEE
Abstract—In this paper, we present a novel languageindependent algorithm for extracting text-lines from handwritten document images. Our algorithm is based on the seam carving ap...
ICMCS
2005
IEEE
13 years 10 months ago
2005
IEEE
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...