3708 search results - page 133 / 742 » Approximating Betweenness Centrality |
115
click to vote
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...
126
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
76
Voted
ISCC
2007
IEEE
15 years 7 months ago
2007
IEEE
Standardization efforts have become an increasingly central issue as business interoperability demands mount. However research on the development process of standards is limited. ...
94
Voted
ICCS
2003
Springer
15 years 6 months ago
2003
Springer
The purpose of this paper is to clarify in the framework of Temporal Concept Analysis the distinction between the notion of the dimension of time and the one-dimensionality of life...
96
Voted
ANTS
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. The conjectures of Deligne, Beilinson, and Bloch-Kato assert that there should be relations between the arithmetic of algebrogeometric objects and the special values of t...