4791 search results - page 96 / 959 » Clustering with partial information |
107
Voted
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
We consider the problem of maintaining information about the rank of a matrix M under changes to its entries. For an n × n matrix M, we show an amortized upper bound of O(nω−1)...
120
Voted
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We describe and analyze efficient algorithms for learning a linear predictor from examples when the learner can only view a few attributes of each training example. This is the ca...
138
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
168
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Modern approaches to speaker recognition (verification) operate in a space of “supervectors” created via concatenation of the mean vectors of a Gaussian mixture model (GMM) a...
183
Voted
AAAI
2012
13 years 7 months ago
2012
We present the first real-world benchmark for sequentiallyoptimal team formation, working within the framework of a class of online football prediction games known as Fantasy Foo...