Sciweavers

107 search results - page 12 / 22
» Tight Results on Minimum Entropy Set Cover
Sort
View
TALG
2008
93views more  TALG 2008»
13 years 7 months ago
Limitations of cross-monotonic cost-sharing schemes
A cost-sharing scheme is a set of rules defining how to share the cost of a service (often computed by solving a combinatorial optimization problem) amongst serviced customers. A ...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
14 years 29 days ago
Communication-Aware Processor Allocation for Supercomputers
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
Michael A. Bender, David P. Bunde, Erik D. Demaine...
COMPGEOM
2008
ACM
13 years 9 months ago
Extremal problems on triangle areas in two and three dimensions
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
Adrian Dumitrescu, Micha Sharir, Csaba D. Tó...
COLT
2005
Springer
14 years 1 months ago
Generalization Error Bounds Using Unlabeled Data
We present two new methods for obtaining generalization error bounds in a semi-supervised setting. Both methods are based on approximating the disagreement probability of pairs of ...
Matti Kääriäinen
COLING
2010
13 years 2 months ago
Simultaneous Ranking and Clustering of Sentences: A Reinforcement Approach to Multi-Document Summarization
Multi-document summarization aims to produce a concise summary that contains salient information from a set of source documents. In this field, sentence ranking has hitherto been ...
Xiaoyan Cai, Wenjie Li, Ouyang You, Hong Yan