1554 search results - page 126 / 311 » Parameterized Complexity and Approximation Algorithms |
160
Voted
COCO
1994
Springer
15 years 7 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
127
Voted
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
140
Voted
ACL
2006
15 years 5 months ago
2006
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...
123
Voted
CVIU
2010
15 years 3 months ago
2010
Estimating motions of a multi-camera system which may not have overlapping fields of view is generally complex and computationally expensive because of the non-zero offset between...
137
Voted
GEOINFORMATICA
1998
15 years 3 months ago
1998
The issue of ®nding similar 3-D surface segments arises in many recent applications of spatial database systems, such as molecular biology, medical imaging, CAD, and geographic i...