3708 search results - page 281 / 742 » Approximating Betweenness Centrality |
144
click to vote
ICC
2007
IEEE
16 years 29 days ago
2007
IEEE
— We present an optimization method for unequal error protection (UEP)-LDPC codes with higher order constellations. By modifying the density evolution algorithm under the Gaussia...
193
click to vote
ER
2007
Springer
16 years 24 days ago
2007
Springer
Approximate data matching applications typically use similarity functions to quantify the degree of likeness between two data instances. There are several similarity functions ava...
136
click to vote
WEBI
2007
Springer
16 years 22 days ago
2007
Springer
This paper proposes a method for the mapping of ontologies that, in a greater extent than other approaches, discovers and exploits sets of latent features for approximating the in...
156
click to vote
ISCAS
2005
IEEE
16 years 6 days ago
2005
IEEE
— Based on a Fourier series analysis, an analytic interconnect model is presented which is suitable for periodic signals, such as a clock signal. In this model, the far end time ...
171
click to vote
COCOON
2005
Springer
16 years 5 days ago
2005
Springer
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...