603 search results - page 22 / 121 » A General Approximation Technique for Constrained Forest Pro... |
113
click to vote
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
205
click to vote
SIGMOD
2005
ACM
16 years 1 months ago
2005
ACM
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
130
click to vote
KDD
2008
ACM
16 years 1 months ago
2008
ACM
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
138
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
167
click to vote
SIGECOM
2011
ACM
14 years 4 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...