186 search results - page 37 / 38 » Clustering Moving Objects via Medoid Clusterings |
CVPR
1999
IEEE
14 years 8 months ago
1999
IEEE
Background estimation and removal based on the joint use of range and color data produces superior results than can be achieved with either data source alone. This is increasingly...
NIPS
2007
13 years 7 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
DAGSTUHL
2010
13 years 7 months ago
2010
We have adopted a numerical method from computational fluid dynamics, the Lattice Boltzmann Method (LBM), for real-time simulation and visualization of flow and amorphous phenomen...
CP
2003
Springer
13 years 11 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
FUIN
2007
13 years 6 months ago
2007
Abstract. Identification of music instruments in polyphonic sounds is difficult and challenging, especially where heterogeneous harmonic partials are overlapping with each other....