7150 search results - page 282 / 1430 » An Approximation Algorithm for Approximation Rank |
185
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
210
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Models of agent-environment interaction that use predictive state representations (PSRs) have mainly focused on the case of discrete observations and actions. The theory of discre...
169
click to vote
ISM
2008
IEEE
16 years 1 months ago
2008
IEEE
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
213
click to vote
CVPR
1997
IEEE
16 years 8 months ago
1997
IEEE
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
210
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...