478 search results - page 39 / 96 » Approximation algorithms for general packing problems and th... |
CVPR
2004
IEEE
14 years 10 months ago
2004
IEEE
Statistical density estimation techniques are used in many computer vision applications such as object tracking, background subtraction, motion estimation and segmentation. The pa...
RTSS
2002
IEEE
14 years 1 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
SODA
2007
ACM
13 years 10 months ago
2007
ACM
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
STOC
1996
ACM
14 years 25 days ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...