Sciweavers

3708 search results - page 36 / 742
» Approximating Betweenness Centrality
Sort
View
OPODIS
2008
15 years 2 months ago
Distributed Approximation of Cellular Coverage
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...
Boaz Patt-Shamir, Dror Rawitz, Gabriel Scalosub
114
Voted
TIT
2010
136views Education» more  TIT 2010»
14 years 7 months ago
The approximate capacity of the many-to-one and one-to-many Gaussian interference channels
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...
Guy Bresler, Abhay Parekh, David N. C. Tse
COMPGEOM
2010
ACM
15 years 5 months ago
Computing similarity between piecewise-linear functions
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreve...
BMCBI
2006
143views more  BMCBI 2006»
15 years 1 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
ICWS
2003
IEEE
15 years 2 months ago
Using DAML-S for P2P Discovery
—Mechanisms for Web services Discovery proposed so far have assumed a centralized registry that collects information about all the Web services available at any given time. Centr...
Massimo Paolucci, Katia P. Sycara, Takuya Nishimur...