1439 search results - page 41 / 288 » Fast approximation of centrality |
114
click to vote
OPODIS
2008
15 years 4 months ago
2008
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...
131
Voted
TIT
2010
14 years 10 months ago
2010
Recently, Etkin, Tse, and Wang found the capacity region of the two-user Gaussian interference channel to within 1 bit/s/Hz. A natural goal is to apply this approach to the Gaussia...
131
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
We introduce mixture trees, a tree-based data-structure for modeling joint probability densities using a greedy hierarchical density estimation scheme. We show that the mixture tr...
141
click to vote
CEAS
2006
Springer
15 years 7 months ago
2006
Springer
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
153
click to vote
TCOS
2010
15 years 1 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...