1480 search results - page 170 / 296 » Distributed algorithms for weighted problems in sparse graph... |
137
Voted
ICS
1993
Tsinghua U.
15 years 4 months ago
1993
Tsinghua U.
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
105
Voted
AI
2007
Springer
15 years 7 months ago
2007
Springer
Importance sampling-based algorithms are a popular alternative when Bayesian network models are too large or too complex for exact algorithms. However, importance sampling is sensi...
141
Voted
COMGEO
2006
ACM
15 years 23 days ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
122
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
74
Voted
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
With rapid advances in VLSI technology, Field Programmable Gate Arrays (FPGAs) are receiving the attention of the Parallel and High Performance Computing community. In this paper,...