2983 search results - page 239 / 597 » The group marriage problem |
196
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
211
click to vote
AAAI
2011
14 years 6 months ago
2011
We consider the problem of modeling network interactions and identifying latent groups of network nodes. This problem is challenging due to the facts i) that the network nodes are...
232
click to vote
ICDAR
2011
IEEE
14 years 6 months ago
2011
IEEE
— A competition on recognition of online handwritten mathematical expressions is organized. Recognition of mathematical expressions has been an attractive problem for the pattern...
157
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
212
click to vote
SCIA
2009
Springer
16 years 1 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...