9842 search results - page 1680 / 1969 » The Complexity of the Matching-Cut Problem |
158
Voted
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
141
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...
243
click to vote
CVPR
2003
IEEE
16 years 6 months ago
2003
IEEE
We wish to determine the epipolar geometry of a stereo camera pair from image measurements alone. This paper describes a solution to this problem which does not require a parametr...
162
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
147
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
We derive a new class of photometric invariants that can be used for a variety of vision tasks including lighting invariant material segmentation, change detection and tracking, a...