3946 search results - page 257 / 790 » The computational complexity of choice sets |
140
click to vote
APAL
2010
15 years 6 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
149
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
219
Voted
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We present a fully-automated method for real-time and marker-free 3D human motion capture. The system computes the 3D shape of the person filmed from a synchronized camera set. We...
171
Voted
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— We present a method for complexity reduction in reachability analysis and controller synthesis via a Schur-based decomposition for LTI systems. The decomposition yields either ...
166
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
The choice of a color space is of great importance for many computer vision algorithms (e.g. edge detection and object recognition). It induces the equivalence classes to the actu...