3708 search results - page 79 / 742 » Approximating Betweenness Centrality |
98
Voted
DMIN
2006
15 years 2 months ago
2006
Abstract-- In this paper we consider d-dimensional spatiotemporal data (d 1) and ways to approximate and index it. We focus on indexing such data for similarity matching using orth...
106
click to vote
FSS
2010
14 years 11 months ago
2010
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
116
Voted
ICDE
2009
IEEE
15 years 7 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
87
Voted
STOC
2003
ACM
16 years 27 days ago
2003
ACM
We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and...
ICASSP
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we propose a coding algorithm for raw images with high dynamic ranges. Our encoder has two layers. In the first layer, 24 bit low dynamic range image is encoded by...