1871 search results - page 54 / 375 » The Ephemeral Pairing Problem |
174
click to vote
ICVS
2009
Springer
15 years 4 months ago
2009
Springer
This paper introduces a system that automatically classifies registration problems based on the type of registration required. Rather than rely on a single "best" algorit...
252
click to vote
CORR
2010
Springer
15 years 23 days ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
168
click to vote
ISBI
2006
IEEE
16 years 7 months ago
2006
IEEE
Mutual information (MI) based image-registration methods that use histograms are known to suffer from the so-called binning problem, caused by the absence of a principled techniqu...
158
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
148
click to vote
ICML
2004
IEEE
15 years 11 months ago
2004
IEEE
We consider the problem of eliminating redundant Boolean features for a given data set, where a feature is redundant if it separates the classes less well than another feature or ...