1554 search results - page 147 / 311 » Parameterized Complexity and Approximation Algorithms |
125
click to vote
APCCAS
2006
IEEE
15 years 5 months ago
2006
IEEE
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...
140
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
169
Voted
CEC
2010
IEEE
14 years 7 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
124
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Abstract. Computing reflective symmetries of 2D and 3D shapes is a classical problem in computer vision and computational geometry. Most prior work has focused on finding the main ...
123
Voted
ISBI
2008
IEEE
16 years 4 months ago
2008
IEEE
We describe a new approach for elucidating the nonlinear degrees of freedom in a distribution of shapes depicted in digital images. By combining a deformation-based method for mea...