3708 search results - page 75 / 742 » Approximating Betweenness Centrality |
139
click to vote
PROPERTYTESTING
2010
14 years 10 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
118
Voted
TR
2010
14 years 7 months ago
2010
Abstract--We quantify the closeness of the approximation between two high-level probabilistic models of cascading failure. In one model called CASCADE, failing components successiv...
122
Voted
SIGMOD
2011
ACM
14 years 3 months ago
2011
ACM
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
136
Voted
CVPR
2004
IEEE
16 years 2 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...
209
click to vote
POPL
2007
ACM
16 years 27 days ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...