3708 search results - page 113 / 742 » Approximating Betweenness Centrality |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
143
click to vote
WINE
2010
Springer
14 years 10 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
102
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
s using Approximately Bisimilar Abstractions: Time-Optimal Control Problems Antoine Girard In this paper, we present a hierarchical approach to time-optimal control using approxima...
123
click to vote
INFOCOM
2011
IEEE
14 years 4 months 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...
135
Voted
CVPR
1997
IEEE
16 years 2 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...