406 search results - page 38 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
SOFSEM
2010
Springer
15 years 8 months ago
2010
Springer
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
134
click to vote
STOC
2010
ACM
15 years 3 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
HPDC
2002
IEEE
15 years 4 months ago
2002
IEEE
With the advent of computational grids, networking performance over the wide-area network (WAN) has become a critical component in the grid infrastructure. Unfortunately, many hig...
112
click to vote
AE
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
112
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
This paper presents a cross-based framework of performing local multipoint filtering efficiently. We formulate the filtering process as a local multipoint regression problem, c...