16596 search results - page 215 / 3320 » Generalized Assignment Problems |
146
Voted
DIALM
2005
ACM
15 years 4 months ago
2005
ACM
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
128
Voted
SIGECOM
2008
ACM
15 years 2 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
147
Voted
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
145
click to vote
FOSSACS
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhap...
126
Voted
PAMI
2006
15 years 2 months ago
2006
A new approach to support vector machine (SVM) classification is proposed wherein each of two data sets are proximal to one of two distinct planes that are not parallel to each oth...