Sciweavers

1518 search results - page 182 / 304
» Exact and Approximate Bandwidth
Sort
View
ICASSP
2011
IEEE
14 years 6 months ago
Searching in one billion vectors: re-rank with source coding
Recent indexing techniques inspired by source coding have been shown successful to index billions of high-dimensional vectors in memory. In this paper, we propose an approach that ...
Hervé Jégou and Romain Tavenard and Matthijs Dou...
CVPR
2011
IEEE
14 years 6 months ago
Is face recognition really a Compressive Sensing problem?
Compressive Sensing has become one of the standard methods of face recognition within the literature. We show, however, that the sparsity assumption which underpins much of this w...
Qinfeng Shi, Anders Eriksson, Anton vandenHengel, ...
CVPR
2011
IEEE
14 years 6 months ago
Truncated Message Passing
Training of conditional random fields often takes the form of a double-loop procedure with message-passing inference in the inner loop. This can be very expensive, as the need to...
Justin Domke
IPL
2011
73views more  IPL 2011»
14 years 5 months ago
Maximum subset intersection
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
Raphaël Clifford, Alexandru Popa
TCS
2011
14 years 4 months ago
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
Pinar Heggernes, Daniel Meister, Andrzej Proskurow...