8298 search results - page 158 / 1660 » On the Complexity of Numerical Analysis |
209
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
143
click to vote
PE
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We consider the classical cyclic polling model with exhaustive or gated service at ...
140
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we present the architecture of a Business Information Analysis provisioning system, BISON. The system is built based on a functioning business information analysis ...
212
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
151
click to vote
TOG
2010
15 years 1 months ago
2010
In this paper, we propose a simple and efficient framework for simulating dispersed bubble flow. Instead of modeling the complex hydrodynamics of numerous small bubbles explicitly...