2137 search results - page 350 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
111
click to vote
ICCSA
2004
Springer
15 years 7 months ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
122
click to vote
TIP
1998
15 years 2 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
137
click to vote
MOC
2011
14 years 9 months ago
2011
Abstract. Various applications in uid dynamics and computational continuum mechanics motivate the development of reliable and e cient adaptive algorithms for mixed nite element m...
147
click to vote
DAGSTUHL
2007
15 years 3 months ago
2007
Iterative aggregation/disaggregation methods (IAD) belong to competitive tools for computation the characteristics of Markov chains as shown in some publications devoted to testing...