4110 search results - page 369 / 822 » Efficient algorithms for the 2-gathering problem |
142
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We revisit the problem of designing the profit-maximizing single-item auction, solved by Myerson in his seminal paper for the case in which bidder valuations are independently dis...
204
Voted
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
193
click to vote
EUROPAR
2010
Springer
15 years 7 months ago
2010
Springer
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
194
click to vote
DAGM
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
182
click to vote
RECSYS
2010
ACM
15 years 7 months ago
2010
ACM
An increasing number of social networking platforms are giving users the option to endorse entities that they find appealing, such as videos, photos, or even other users. We defin...