Sciweavers

2983 search results - page 50 / 597
» The group marriage problem
Sort
View
ICCV
2007
IEEE
14 years 12 months ago
Normalized Cuts Revisited: A Reformulation for Segmentation with Linear Grouping Constraints
Indisputably Normalized Cuts is one of the most popular segmentation algorithms in computer vision. It has been applied to a wide range of segmentation tasks with great success. A...
Anders P. Eriksson, Carl Olsson, Fredrik Kahl
ICC
2008
IEEE
137views Communications» more  ICC 2008»
14 years 4 months ago
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Divisio...
David Coudert, Florian Huc, Fabrice Peix, Marie-Em...
CVPR
2011
IEEE
13 years 6 months ago
Online Group-Structured Dictionary Learning
We develop a dictionary learning method which is (i) online, (ii) enables overlapping group structures with (iii) non-convex sparsity-inducing regularization and (iv) handles the ...
Zoltan Szabo, Barnabas Poczos, Andras Lorincz
STOC
1987
ACM
82views Algorithms» more  STOC 1987»
14 years 1 months ago
Permutation Groups in NC
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
László Babai, Eugene M. Luks, &Aacut...
DAM
2008
123views more  DAM 2008»
13 years 10 months ago
Ultrametrics, Banach's fixed point theorem and the Riordan group
We interpret the reciprocation process in K[[x]] as a fixed point problem related to contractive functions for certain adequate ultrametric spaces. This allows us to give a dynamic...
Ana Luzón, Manuel A. Morón