Sciweavers

3708 search results - page 54 / 742
» Approximating Betweenness Centrality
Sort
View
FCT
2003
Springer
14 years 4 months ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith
UAI
2000
14 years 10 days ago
Value-Directed Belief State Approximation for POMDPs
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
Pascal Poupart, Craig Boutilier
TASLP
2010
122views more  TASLP 2010»
13 years 5 months ago
Error Approximation and Minimum Phone Error Acoustic Model Estimation
Minimum phone error (MPE) acoustic parameter estimation involves calculation of edit distances (errors) between correct and incorrect hypotheses. In the context of large vocabulary...
Matt Gibson 0002, Thomas Hain
ATAL
2006
Springer
14 years 2 months ago
Decentralized planning under uncertainty for teams of communicating agents
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
Matthijs T. J. Spaan, Geoffrey J. Gordon, Nikos A....
PERCOM
2010
ACM
13 years 9 months ago
Gateway designation for timely communications in instant mesh networks
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
Bo Xing, Mayur Deshpande, Sharad Mehrotra, Nalini ...