316 search results - page 14 / 64 » Network Generalized Hamming Weight |
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks wit...
172
click to vote
GIS
2006
ACM
16 years 24 days ago
2006
ACM
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...
104
click to vote
PODS
2004
ACM
15 years 12 months ago
2004
ACM
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...
113
Voted
STOC
2009
ACM
16 years 11 days ago
2009
ACM
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
ICML
2009
IEEE
16 years 17 days ago
2009
IEEE
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...