366 search results - page 25 / 74 » Dynamic Programming for Graphs on Surfaces |
136
click to vote
ISSTA
2009
ACM
15 years 11 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
159
click to vote
ICDCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider distributed applications that continuously stream data across the network, where data needs to be aggregated and processed to produce a 'useful' stream of up...
154
click to vote
IBPRIA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. This paper presents a new approach to the problem of simultaneous location and segmentation of object in images. The main emphasis is done on the information provided by ...
146
Voted
EOR
2008
15 years 5 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
182
click to vote
FAW
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...