Sciweavers

4047 search results - page 261 / 810
» The Discrete Basis Problem
Sort
View
139
Voted
NIPS
2004
15 years 6 months ago
VDCBPI: an Approximate Scalable Algorithm for Large POMDPs
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
Pascal Poupart, Craig Boutilier
158
Voted
WSC
2001
15 years 5 months ago
Use of DaSSF in a scalable multiprocessor wireless simulation architecture
The problem of efficient load distribution and scaling of large-scale wireless communication system simulation on multiprocessor architectures (both shared memory and cluster arra...
Trefor J. Delve, Nathan Smith
NIPS
2003
15 years 5 months ago
Multiple-Instance Learning via Disjunctive Programming Boosting
Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for classification problems where labels are associated with se...
Stuart Andrews, Thomas Hofmann
AMC
2008
111views more  AMC 2008»
15 years 4 months ago
A domain decomposition method for the Oseen-viscoelastic flow equations
We study a non-overlapping domain decomposition method for the Oseen-viscoelastic flow problem. The data on the interface are transported through Newmann and Dirichlet boundary co...
Eleanor Jenkins, Hyesuk Lee
120
Voted
BSL
2008
100views more  BSL 2008»
15 years 4 months ago
Hyperlinear and Sofic Groups: A Brief Guide
This is an introductory survey of the emerging theory of two new classes of (discrete, countable) groups, called hyperlinear and sofic groups. They can be characterized as subgroup...
Vladimir Pestov