1272 search results - page 117 / 255 » The Set Cover with Pairs Problem |
103
Voted
CVPR
2006
IEEE
16 years 2 months ago
2006
IEEE
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
96
Voted
CHES
2006
Springer
15 years 4 months ago
2006
Springer
In recent years, some countermeasures against Differential Power Analysis (DPA) at the logic level have been proposed. At CHES 2005 conference, Popp and Mangard proposed a new coun...
147
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
91
Voted
ILP
2003
Springer
15 years 6 months ago
2003
Springer
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
82
Voted
DM
2010
15 years 24 days ago
2010
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...