80 search results - page 13 / 16 » Grouping Techniques for Scheduling Problems: Simpler and Fas... |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
GPCE
2007
Springer
14 years 2 months ago
2007
Springer
Multiple dispatch – the selection of a function to be invoked based on the dynamic type of two or more arguments – is a solution to several classical problems in object-orient...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
JUCS
2008
13 years 8 months ago
2008
: Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the processing power of the modern PC does not depend only of the processing power of...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRFs o...