3708 search results - page 167 / 742 » Approximating Betweenness Centrality |
113
click to vote
TC
2010
14 years 12 months ago
2010
Using a general polynomial approximation approach, we present an arithmetic library generator for the logarithmic number system (LNS). The generator produces optimized LNS arithmet...
130
click to vote
STOC
2010
ACM
16 years 2 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
151
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
187
click to vote
PG
2007
IEEE
15 years 11 months ago
2007
IEEE
We introduce an algorithm for approximating a 2manifold 3D mesh by a set of developable surfaces. Each developable surface is a generalized cylinder represented as a strip of tria...
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— In this paper, we consider the throughput modelling and fairness provisioning in CSMA/CA based ad-hoc networks. The main contributions are: Firstly, a throughput model based on...