Sciweavers

2520 search results - page 440 / 504
» The complexity of approximating entropy
Sort
View
ATAL
2009
Springer
14 years 8 months ago
Replicator Dynamics for Multi-agent Learning: An Orthogonal Approach
Today's society is largely connected and many real life applications lend themselves to be modeled as multi-agent systems. Although such systems as well as their models are d...
Michael Kaisers, Karl Tuyls
HVEI
2009
14 years 7 months ago
Harmonic analysis for cognitive vision: perisaccadic perception
The data model for image representation in terms of projective Fourier transform (PFT) is well adapted to both image perspective transformations and the retinotopic mappings of th...
Jacek Turski
ICIP
2010
IEEE
14 years 8 months ago
Earth Mover Distance on superpixels
Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problem...
Sylvain Boltz, Frank Nielsen, Stefano Soatto
CGF
2010
171views more  CGF 2010»
14 years 6 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
CGF
2010
135views more  CGF 2010»
14 years 6 months ago
Interactive Rendering of Non-Constant, Refractive Media Using the Ray Equations of Gradient-Index Optics
Existing algorithms can efficiently render refractive objects of constant refractive index. For a medium with a continuously varying index of refraction, most algorithms use the r...
Chen Cao, Zhong Ren, Baining Guo, Kun Zhou