451 search results - page 64 / 91 » Some Lower Bounds on Geometric Separability Problems |
QUESTA
2007
14 years 9 months ago
2007
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, appli...
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
128
click to vote
DEM
2001
Springer
15 years 2 months ago
2001
Springer
A common concern of the real−time terrain visualisation of today is the lack of geometric detail, when the terrain model is studied close enough. This is primary not a problem of...
SIAMCOMP
1998
14 years 9 months ago
1998
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...