355 search results - page 6 / 71 » A New Approximation Technique for Resource-Allocation Proble... |
87
Voted
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
151
click to vote
VEE
2012
ACM
13 years 5 months ago
2012
ACM
With the growing adoption of virtualized datacenters and cloud hosting services, the allocation and sizing of resources such as CPU, memory, and I/O bandwidth for virtual machines...
ISCAS
2006
IEEE
15 years 3 months ago
2006
IEEE
— A new technique that makes use of a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introdu...
AIPS
2006
14 years 11 months ago
2006
We present techniques for incrementally managing schedules in domains where activities accrue quality as a function of the time and resources allocated to them and the goal is to ...
90
Voted
FOCS
2000
IEEE
15 years 1 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...