369 search results - page 39 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
111
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
104
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
118
click to vote
NN
2000
Springer
14 years 11 months ago
2000
Springer
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
120
click to vote
FOIKS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...