2434 search results - page 410 / 487 » Algorithmic Randomness of Closed Sets |
108
click to vote
SIGECOM
2008
ACM
15 years 14 days ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
124
Voted
SWAT
1998
Springer
15 years 4 months ago
1998
Springer
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
134
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
103
click to vote
STOC
2007
ACM
16 years 26 days ago
2007
ACM
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
125
click to vote
SIGECOM
2010
ACM
15 years 5 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...