190
Voted
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Given a string of characters, the Burrows-Wheeler Transform rearranges the characters in it so as to produce another string of the same length which is more amenable to compressio...
207
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather t...
244
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
202
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
193
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...