3946 search results - page 565 / 790 » The computational complexity of choice sets |
177
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
175
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
225
click to vote
AB
2008
Springer
16 years 1 months ago
2008
Springer
A specific class of ODEs has been shown to be adequate to describe the essential features of the complex dynamics of Gene-Regulatory Networks (GRN). But, the effective exploitatio...
190
click to vote
AVSS
2006
IEEE
16 years 22 days ago
2006
IEEE
Background modeling for dynamic scenes is an important problem in the context of real time video surveillance systems. Several nonparametric background models have been proposed t...
186
click to vote
SI3D
2005
ACM
16 years 6 days ago
2005
ACM
We present a new interactive method to texture complex geometries at very high resolution, while using little memory and without the need for a global planar parameterization. We ...