335 search results - page 39 / 67 » Resolvent of large random graphs |
146
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
HIPEAC
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. Exposing more instruction-level parallelism in out-of-order superscalar processors requires increasing the number of dynamic in-flight instructions. However, large instru...
117
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
112
click to vote
CSDA
2008
14 years 11 months ago
2008
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
IDA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...