2314 search results - page 163 / 463 » Minimal Partitions of a Graph |
160
click to vote
MICRO
2005
IEEE
15 years 9 months ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
163
click to vote
CIKM
2007
Springer
15 years 8 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
176
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
220
click to vote
BIRTHDAY
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Risk analysis has been used to manage the security of systems for several decades. However, its use has been limited to offline risk computation and manual response. In c...
118
click to vote
GBRPR
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...