406 search results - page 78 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
CGF
2004
13 years 8 months ago
2004
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
JCSS
2000
13 years 8 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
WWW
2011
ACM
13 years 3 months ago
2011
ACM
In this paper, we study the problem of transfer learning from text to images in the context of network data in which link based bridges are available to transfer the knowledge bet...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...