2479 search results - page 495 / 496 » A Computational Theory of Working Memory |
SIGECOM
2011
ACM
12 years 8 months ago
2011
ACM
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
CIKM
2011
Springer
12 years 5 months ago
2011
Springer
Today, a number of algorithms exist for constructing tag hierarchies from social tagging data. While these algorithms were designed with ontological goals in mind, we know very li...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
KDD
2012
ACM
11 years 8 months ago
2012
ACM
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...