1201 search results - page 116 / 241 » Linear Probing and Graphs |
112
click to vote
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
127
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
107
Voted
COLOGNETWENTE
2009
15 years 1 months ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
145
Voted
TIT
2011
14 years 7 months ago
2011
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
98
Voted
MM
2005
ACM
15 years 6 months ago
2005
ACM
To better understand the content of multimedia, a lot of research efforts have been made on how to learn from multi-modal feature. In this paper, it is studied from a graph point ...