Sciweavers

2957 search results - page 360 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
COR
2008
131views more  COR 2008»
15 years 5 months ago
Queueing analysis of a server node in transaction processing middleware systems
Quantitative performance modeling of complex information systems is of immense importance for designing enterprise e-business infrastructures and applications. In this paper, we p...
Wei Xiong, Tayfur Altiok
GIS
2010
ACM
15 years 5 months ago
Scalable shortest paths browsing on land surface
The growing popularity of online Earth visualization tools and geo-realistic games and the availability of high resolution terrain data have motivated a new class of queries to th...
Songhua Xing, Cyrus Shahabi
TVCG
2010
162views more  TVCG 2010»
15 years 4 months ago
Computing Robustness and Persistence for Images
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber
ACL
2009
15 years 4 months ago
A Note on the Implementation of Hierarchical Dirichlet Processes
The implementation of collapsed Gibbs samplers for non-parametric Bayesian models is non-trivial, requiring considerable book-keeping. Goldwater et al. (2006a) presented an approx...
Phil Blunsom, Trevor Cohn, Sharon Goldwater, Mark ...
ICASSP
2011
IEEE
14 years 10 months ago
Bayesian reinforcement learning for POMDP-based dialogue systems
Spoken dialogue systems are gaining popularity with improvements in speech recognition technologies. Dialogue systems can be modeled effectively using POMDPs, achieving improvemen...
ShaoWei Png, Joelle Pineau