1201 search results - page 151 / 241 » Linear Probing and Graphs |
130
Voted
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
134
click to vote
HEURISTICS
2002
15 years 3 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
124
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
150
click to vote
ECCC
2010
15 years 2 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
136
click to vote
EMNLP
2010
15 years 2 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...