3708 search results - page 70 / 742 » Approximating Betweenness Centrality |
65
Voted
MOC
2002
15 years 7 days ago
2002
We consider finite element operators defined on "rough" functions in a bounded polyhedron in RN . Insisting on preserving positivity in the approximations, we discover a...
112
Voted
VLDB
2005
ACM
15 years 6 months ago
2005
ACM
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases str...
98
Voted
CPM
2000
Springer
15 years 4 months ago
2000
Springer
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
80
Voted
CORR
2010
Springer
15 years 20 days ago
2010
Springer
In practical nonlinear filtering, the assessment of achievable filtering performance is important. In this paper, we focus on the problem of how to efficiently approximate the post...
CPM
2009
Springer
15 years 7 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...