3096 search results - page 35 / 620 » The Generalized FITC Approximation |
INFOCOM
2011
IEEE
13 years 1 days ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
PAMI
2007
13 years 8 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
CVPR
2010
IEEE
13 years 7 months ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...