Sciweavers

697 search results - page 91 / 140
» Approximation of Information Granule Sets
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 10 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
FUIN
2008
112views more  FUIN 2008»
13 years 10 months ago
A New Probabilistic Approach for Fractal Based Image Compression
Abstract. Approximation of an image by the attractor evolved through iterations of a set of contractive maps is usually known as fractal image compression. The set of maps is calle...
Suman K. Mitra, Malay Kumar Kundu, C. A. Murthy, B...
IJON
2006
100views more  IJON 2006»
13 years 10 months ago
Analyzing the robustness of redundant population codes in sensory and feature extraction systems
Sensory systems often use groups of redundant neurons to represent stimulus information both during transduction and population coding of features. This redundancy makes the syste...
Christopher J. Rozell, Don H. Johnson
MST
2010
93views more  MST 2010»
13 years 8 months ago
Atomic Congestion Games: Fast, Myopic and Concurrent
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
CVPR
2010
IEEE
13 years 8 months ago
Common visual pattern discovery via spatially coherent correspondences
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
Hairong Liu, Shuicheng Yan