Sciweavers

457 search results - page 48 / 92
» cores 2005
Sort
View
COLT
2005
Springer
14 years 11 months ago
Loss Bounds for Online Category Ranking
Category ranking is the task of ordering labels with respect to their relevance to an input instance. In this paper we describe and analyze several algorithms for online category r...
Koby Crammer, Yoram Singer
CE
2007
104views more  CE 2007»
14 years 9 months ago
The distance from isolation: Why communities are the logical conclusion in e-learning
This paper argues that the internet is built around key technology design features of openness, robustness and decentralisation. These design features have transformed into social...
Martin Weller
85
Voted
ASPDAC
2005
ACM
97views Hardware» more  ASPDAC 2005»
15 years 3 months ago
Opportunities and challenges for better than worst-case design
The progressive trend of fabrication technologies towards the nanometer regime has created a number of new physical design challenges for computer architects. Design complexity, u...
Todd M. Austin, Valeria Bertacco, David Blaauw, Tr...
SAT
2005
Springer
129views Hardware» more  SAT 2005»
15 years 3 months ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah
72
Voted
STACS
2005
Springer
15 years 3 months ago
Cost Sharing and Strategyproof Mechanisms for Set Cover Games
Abstract. We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, core, and/or group-strategyproof. We first study the cost sha...
Xiang-Yang Li, Zheng Sun, Weizhao Wang