Sciweavers

3096 search results - page 97 / 620
» The Generalized FITC Approximation
Sort
View
MOBIHOC
2007
ACM
16 years 2 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
GBRPR
2005
Springer
15 years 8 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli
ISIPTA
2005
IEEE
168views Mathematics» more  ISIPTA 2005»
15 years 8 months ago
Approximate Inference in Credal Networks by Variational Mean Field Methods
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman
ICCSA
2003
Springer
15 years 8 months ago
Uniform Approximations for Transcendental Functions
A heuristic method to construct uniform approximations to analytic transcendental functions is developed as a generalization of the Hermite-Pad´e interpolation to infinite interv...
Serge Winitzki
SODA
1992
ACM
179views Algorithms» more  SODA 1992»
15 years 4 months ago
Approximating the Minimum Weight Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
David Eppstein