2040 search results - page 72 / 408 » Approximate Expectation Maximization |
ICDM
2007
IEEE
15 years 5 months ago
2007
IEEE
Text clustering is most commonly treated as a fully automated task without user supervision. However, we can improve clustering performance using supervision in the form of pairwi...
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
105
click to vote
AAAI
2008
15 years 1 months ago
2008
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
TIT
2010
14 years 6 months ago
2010
This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bou...