296 search results - page 44 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
97
Voted
CGF
2010
14 years 9 months ago
2010
Moving-Least-Squares (MLS) Surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-unif...
95
Voted
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
MMS
2000
14 years 9 months ago
2000
An admission control algorithm for a multimedia server is responsible for determining if a new request can be accepted without violating the Quality of Service (QoS) requirements o...
PAMI
2007
14 years 9 months ago
2007
—This paper presents a novel approach for estimating the parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterio...