Sciweavers

312 search results - page 46 / 63
» Degree Bounded Network Design with Metric Costs
Sort
View
WWW
2007
ACM
14 years 9 months ago
Long distance wireless mesh network planning: problem formulation and solution
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...
Sayandeep Sen, Bhaskaran Raman
MOC
2011
12 years 11 months ago
Calculating cyclotomic polynomials
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...
Andrew Arnold, Michael B. Monagan
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 6 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
IMC
2010
ACM
13 years 6 months ago
CloudCmp: comparing public cloud providers
While many public cloud providers offer pay-as-you-go computing, their varying approaches to infrastructure, virtualization, and software services lead to a problem of plenty. To ...
Ang Li, Xiaowei Yang, Srikanth Kandula, Ming Zhang
MOR
2010
118views more  MOR 2010»
13 years 7 months ago
Strategyproof Approximation of the Minimax on Networks
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...