Sciweavers

7015 search results - page 1265 / 1403
» Approximation algorithms for co-clustering
Sort
View
AAAI
1992
13 years 10 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
ATAL
2010
Springer
13 years 10 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
ATAL
2010
Springer
13 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»
13 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 ...
DMSN
2010
ACM
13 years 10 months ago
PAO: power-efficient attribution of outliers in wireless sensor networks
Sensor nodes constitute inexpensive, disposable devices that are often scattered in harsh environments of interest so as to collect and communicate desired measurements of monitor...
Nikos Giatrakos, Yannis Kotidis, Antonios Deligian...
« Prev « First page 1265 / 1403 Last » Next »