Sciweavers

5580 search results - page 13 / 1116
» Randomized priority algorithms
Sort
View
EMMCVPR
2011
Springer
13 years 11 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
DATESO
2010
150views Database» more  DATESO 2010»
14 years 9 months ago
Modeling and Verification of Priority Assignment in Real-Time Databases Using Uppaal
Abstract. Real-time database management systems (RTDBMS) are recently subject of an intensive research. Model checking algorithms and verification tools are of great concern as wel...
Martin Kot
SIAMCOMP
2012
13 years 2 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
JPDC
2007
92views more  JPDC 2007»
14 years 11 months ago
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
Jong-Kook Kim, Sameer Shivle, Howard Jay Siegel, A...
QUESTA
2007
170views more  QUESTA 2007»
14 years 11 months ago
Priority queueing systems: from probability generating functions to tail probabilities
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to inve...
Tom Maertens, Joris Walraevens, Herwig Bruneel