3708 search results - page 76 / 742 » Approximating Betweenness Centrality |
110
click to vote
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...
97
Voted
WADS
2007
Springer
15 years 6 months ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
105
Voted
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Manifolds are widely used to model non-linearity arising in a range of computer vision applications. This paper treats statistics on manifolds and the loss of accuracy occurring wh...
CVPR
2006
IEEE
16 years 2 months ago
2006
IEEE
Recently four non-iterative algorithms for simultaneous low rank approximations of matrices (SLRAM) have been presented by several researchers. In this paper, we show that those a...
102
Voted
TAMC
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we present a survey of the approximability and fixed-parameter tractability results for some Exemplar Genomic Distance problems. We mainly focus on three problems: ...