477 search results - page 66 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— The paper deals with the problem of the carrier frequency-offset (CFO) estimation for wireless communications. Since the well-known maximum-likelihood (ML) CFO estimator is rat...
JMMA
2002
13 years 8 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
SAC
2002
ACM
13 years 8 months ago
2002
ACM
This paper presents a novel approach for the problem of generating tiled code for nested for-loops using a tiling transformation. Tiling or supernode transformation has been widel...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
Several object categorization algorithms use kernel methods over multiple cues, as they offer a principled approach to combine multiple cues, and to obtain state-of-theart perform...
TOG
2008
13 years 8 months ago
2008
Robust treatment of complex collisions is a challenging problem in cloth simulation. Some state of the art methods resolve collisions iteratively, invoking a fail-safe when a boun...