599 search results - page 77 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
143
Voted
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...
105
Voted
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
96
Voted
IJCAI
2007
15 years 4 months ago
2007
Classic direct mechanisms require full type (or utility) revelation from participating agents, something that can be very difficult in practical multi-attribute settings. In this...
154
Voted
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
120
Voted
NIPS
2007
15 years 4 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...