Sciweavers

5 search results - page 1 / 1
» Getting Good Value. Facts, Values, and Goals in Computationa...
Sort
View
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 5 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
IUI
2003
ACM
13 years 9 months ago
A model of textual affect sensing using real-world knowledge
This paper presents a novel way for assessing the affective qualities of natural language and a scenario for its use. Previous approaches to textual affect sensing have employed k...
Hugo Liu, Henry Lieberman, Ted Selker
SIAMIS
2008
174views more  SIAMIS 2008»
13 years 4 months ago
Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
We consider the restoration of piecewise constant images where the number of the regions and their values are not fixed in advance, with a good difference of piecewise constant val...
Mila Nikolova, Michael K. Ng, Shuqin Zhang, Wai-Ki...
FOCS
2007
IEEE
13 years 11 months ago
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
Parikshit Gopalan, Subhash Khot, Rishi Saket