Sciweavers

2827 search results - page 64 / 566
» Robustness of PSPACE-complete sets
Sort
View
IJON
2008
114views more  IJON 2008»
13 years 10 months ago
A robust model for spatiotemporal dependencies
Real-world data sets such as recordings from functional magnetic resonance imaging often possess both spatial and temporal structure. Here, we propose an algorithm including such ...
Fabian J. Theis, Peter Gruber, Ingo R. Keck, Elmar...
NLE
2008
106views more  NLE 2008»
13 years 10 months ago
Robust parsing and spoken negotiative dialogue with databases
This paper presents a robust parsing algorithm and semantic formalism for the interpretation of utterances in spoken negotiative dialogue with databases. The algorithm works in tw...
Johan Boye, Mats Wirén
DISOPT
2008
99views more  DISOPT 2008»
13 years 10 months ago
Computing robust basestock levels
This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decom...
Daniel Bienstock, Nuri Özbay
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 10 months ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
UAI
2004
13 years 11 months ago
Robust Probabilistic Inference in Distributed Systems
Probabilistic inference problems arise naturally in distributed systems such as sensor networks and teams of mobile robots. Inference algorithms that use message passing are a nat...
Mark A. Paskin, Carlos Guestrin