16596 search results - page 157 / 3320 » Generalized Assignment Problems |
124
click to vote
JMLR
2006
15 years 2 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
130
Voted
JCST
2008
15 years 2 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
97
Voted
DAC
2005
ACM
16 years 3 months ago
2005
ACM
In this paper, we present a new linear-time retiming algorithm that produces near-optimal results. Our implementation is specifically targeted at Altera's Stratix [1] FPGAbas...
115
click to vote
ACL
2007
15 years 3 months ago
2007
Standard approaches to Chinese word segmentation treat the problem as a tagging task, assigning labels to the characters in the sequence indicating whether the character marks a w...
154
click to vote
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...