Sciweavers

2128 search results - page 310 / 426
» A general characterization of indulgence
Sort
View
IJCAI
2007
14 years 5 days ago
A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
Janusz Marecki, Sven Koenig, Milind Tambe
LREC
2008
146views Education» more  LREC 2008»
14 years 5 days ago
On the Use of Web Resources and Natural Language Processing Techniques to Improve Automatic Speech Recognition Systems
Language models used in current automatic speech recognition systems are trained on general-purpose corpora and are therefore not relevant to transcribe spoken documents dealing w...
Gwénolé Lecorvé, Guillaume Gr...
NIPS
2007
14 years 5 days ago
Loop Series and Bethe Variational Bounds in Attractive Graphical Models
Variational methods are frequently used to approximate or bound the partition or likelihood function of a Markov random field. Methods based on mean field theory are guaranteed ...
Erik B. Sudderth, Martin J. Wainwright, Alan S. Wi...
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
14 years 5 days ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
WICON
2008
14 years 5 days ago
A graph based routing algorithm for multi-hop cognitive radio networks
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
Yogesh Reddy Kondareddy, Prathima Agrawal