Sciweavers

6365 search results - page 334 / 1273
» Fast Local Computation Algorithms
Sort
View
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
16 years 4 days ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
ICPR
2004
IEEE
16 years 7 months ago
Local Fisher Embedding
In recent work, several supervised spectral embedding procedures have been proposed. Although experimentally validated, the construction of these algorithms was rather ad hoc. Thi...
Dick de Ridder, Marco Loog, Marcel J. T. Reinders
TC
2002
15 years 6 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...
GI
2009
Springer
15 years 4 months ago
Gaussian Mixture (GM) Passive Localization using Time Difference of Arrival (TDOA)
: This paper describes the passive emitter localization using Time Difference of Arrival (TDOA) measurements. It investigates various methods for estimating the solution of this no...
Regina Kaune
ICPR
2006
IEEE
16 years 7 months ago
Fingerprint Reference Point Detection Based on Local Axial Symmetry
Reference point detection is an important process for fingerprint analysis. In this paper, we propose a novel feature which is named local axial symmetry (LAS) and present an algo...
Chao Zhang, Pengwei Hao, Tong Liu