3708 search results - page 100 / 742 » Approximating Betweenness Centrality |
138
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
192
Voted
SIGMOD
2008
ACM
16 years 24 days ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
108
Voted
CGI
1998
IEEE
15 years 4 months ago
1998
IEEE
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
141
Voted
ICDE
2012
IEEE
13 years 3 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
113
click to vote
ICCV
1999
IEEE
16 years 2 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...