1201 search results - page 55 / 241 » Linear Probing and Graphs |
92
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
105
Voted
WG
2001
Springer
15 years 5 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
111
click to vote
ESOP
2000
Springer
15 years 4 months ago
2000
Springer
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...
125
click to vote
HIPC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
88
Voted
CORR
2004
Springer
15 years 12 days ago
2004
Springer
We consider linear systems arising from the use of the finite element method for solving a certain class of linear elliptic problems. Our main result is that these linear systems, ...