Sciweavers

25 search results - page 4 / 5
» A Simple Approximation for Modeling Nonstationary Queues
Sort
View
177
Voted
EMMCVPR
2011
Springer
13 years 10 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
PE
2008
Springer
106views Optimization» more  PE 2008»
14 years 10 months ago
Heavy traffic analysis of polling models by mean value analysis
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 ...
Robert D. van der Mei, Erik M. M. Winands
87
Voted
IWQOS
2004
Springer
15 years 3 months ago
Provisioning servers in the application tier for e-commerce systems
Abstract— Server providers that support e-commerce applications as a service to multiple e–commerce websites traditionally use a tiered server architecture. This architecture i...
Daniel A. Villela, Prashant Pradhan, Dan Rubenstei...
113
Voted
ANSS
1996
IEEE
15 years 2 months ago
Computation of the Asymptotic Bias and Variance for Simulation of Markov Reward Models
The asymptotic bias and variance are important determinants of the quality of a simulation run. In particular, the asymptotic bias can be used to approximate the bias introduced b...
Aad P. A. van Moorsel, Latha A. Kant, William H. S...
89
Voted
CAV
2006
Springer
165views Hardware» more  CAV 2006»
15 years 1 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...