415 search results - page 46 / 83 » An efficient approximation for the Generalized Assignment Pr... |
WINE
2009
Springer
14 years 2 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
COMPGEOM
2004
ACM
14 years 25 days ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
MM
2004
ACM
14 years 25 days ago
2004
ACM
In this paper, we propose and investigate a new user scenario for face annotation, in which users are allowed to multi-select a group of photographs and assign names to these phot...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...