Sciweavers

3875 search results - page 735 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
70
Voted
ATAL
2010
Springer
14 years 10 months ago
Robust Bayesian methods for Stackelberg security games
Recent work has applied game-theoretic models to real-world security problems at the Los Angeles International Airport (LAX) and Federal Air Marshals Service (FAMS). The analysis o...
Christopher Kiekintveld, Milind Tambe, Janusz Mare...
CIMAGING
2009
184views Hardware» more  CIMAGING 2009»
14 years 10 months ago
Fast space-varying convolution and its application in stray light reduction
Space-varying convolution often arises in the modeling or restoration of images captured by optical imaging systems. For example, in applications such as microscopy or photography...
Jianing Wei, Guangzhi Cao, Charles A. Bouman, Jan ...
ECAI
2010
Springer
14 years 10 months ago
Bayesian Monte Carlo for the Global Optimization of Expensive Functions
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
Perry Groot, Adriana Birlutiu, Tom Heskes
ICASSP
2010
IEEE
14 years 10 months ago
Distributed bearing estimation via matrix completion
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...
Andrew Waters, Volkan Cevher
ICDCS
2010
IEEE
14 years 10 months ago
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...