Sciweavers

15073 search results - page 389 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
15 years 4 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani
ADHOCNOW
2004
Springer
15 years 11 months ago
Weathering the Storm: Managing Redundancy and Security in Ad Hoc Networks
Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threat...
Mike Burmester, Tri Van Le, Alec Yasinsac
MOC
1998
107views more  MOC 1998»
15 years 5 months ago
A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical...
Suely Oliveira
ECCV
2008
Springer
16 years 8 months ago
Belief Propagation with Directional Statistics for Solving the Shape-from-Shading Problem
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
Tom S. F. Haines, Richard C. Wilson
ICPR
2008
IEEE
16 years 20 days ago
Manifold denoising with Gaussian Process Latent Variable Models
For a finite set of points lying on a lower dimensional manifold embedded in a high-dimensional data space, algorithms have been developed to study the manifold structure. Howeve...
Yan Gao, Kap Luk Chan, Wei-Yun Yau