16404 search results - page 2889 / 3281 » A set coverage problem |
244
Voted
EDBT
2012
ACM
13 years 10 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
232
click to vote
AAAI
2012
13 years 10 months ago
2012
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speci...
206
click to vote
AAAI
2012
13 years 10 months ago
2012
We consider the problem of selecting fair divisions of a heterogeneous divisible good among a set of agents. Recent work (Cohler et al., AAAI 2011) focused on designing algorithms...
653
click to vote
ICSE
2012
IEEE-ACM
13 years 10 months ago
2012
IEEE-ACM
—As smartphones become popular, manufacturers such as Samsung Electronics are developing smartphones with rich functionality such as a camera and photo editing quickly, which acc...
225
Voted
TIFS
2010
15 years 6 months ago
2010
In multimodal biometric information fusion, it is common to encounter missing modalities in which matching cannot be performed. As a result, at the match score level, this implies...