Modern transactional response-time sensitive applications have run into practical limits on the size of garbage collected heaps. The heap can only grow until GC pauses exceed the ...
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
In this paper we present a distributed, application-morphable, algorithm for waking up appropriate sensor nodes in a heterogeneous sensor network. We assume a sensor field consisti...
Akis Spyropoulos, Cauligi S. Raghavendra, Viktor K...
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
Identifying criminals and victims in evidence images, where their faces are covered or obstructed, is a challenging task. In the legal case, United States v. Michael Joseph Pepe (...