1871 search results - page 107 / 375 » The Ephemeral Pairing Problem |
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Conventional stereo matching algorithms assume color constancy on the corresponding opaque pixels in the stereo images. However, when the foreground objects with fractional bounda...
ISSAC
2009
Springer
15 years 5 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
ECAI
2004
Springer
15 years 4 months ago
2004
Springer
The standard SVM formulation for binary classification is based on the Hinge loss function, where errors are considered not correlated. Due to this, local information in the featu...
MFCS
2004
Springer
15 years 4 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
GD
1998
Springer
15 years 3 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...