Sciweavers

8298 search results - page 137 / 1660
» On the Complexity of Numerical Analysis
Sort
View
IJCV
2010
249views more  IJCV 2010»
15 years 4 months ago
A Computational Model of Multidimensional Shape
We develop a computational model of shape that extends existing Riemannian models of shape of curves to multidimensional objects of general topological type. We construct shape sp...
Xiuwen Liu, Yonggang Shi, Ivo D. Dinov, Washington...
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 4 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
IPPS
2010
IEEE
15 years 4 months ago
Parallel I/O performance: From events to ensembles
Parallel I/O is fast becoming a bottleneck to the research agendas of many users of extreme scale parallel computers. The principle cause of this is the concurrency explosion of hi...
Andrew Uselton, Mark Howison, Nicholas J. Wright, ...
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 10 months ago
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Yang Cai, Ting Zhang
AAAI
2011
14 years 6 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev