1201 search results - page 49 / 241 » Linear Probing and Graphs |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We discuss the problem of determining the complete weight hierarchy of linear error correcting codes associated to Grassmann varieties and, more generally, to Schubert va...
CC
2007
Springer
14 years 5 months ago
2007
Springer
In this paper, we extend past work on Linear Scan register allocation, and propose two Extended Linear Scan (ELS) algorithms that retain the compiletime efficiency of past Linear ...
ICALP
1997
Springer
14 years 3 months ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
AAAI
2008
14 years 1 months ago
2008
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
NETWORKS
2008
13 years 11 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...