3708 search results - page 153 / 742 » Approximating Betweenness Centrality |
152
click to vote
SWAT
2010
Springer
14 years 11 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
104
Voted
JELIA
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
COCOON
2007
Springer
15 years 7 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
135
Voted
PAMI
2011
14 years 7 months ago
2011
— This paper introduces a product quantization based approach for approximate nearest neighbor search. The idea is to decomposes the space into a Cartesian product of low dimensi...
119
Voted
TCOM
2010
14 years 11 months ago
2010
—Bit-interleaved coded modulation (BICM) has been adopted in many systems and standards for spectrally efficient coded transmission. The analytical evaluation of BICM performanc...