Sciweavers

6028 search results - page 882 / 1206
» Randomness as a resource for design
Sort
View
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 6 months ago
Graph Annotations in Modeling Complex Network Topologies
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, A...
CCR
2005
129views more  CCR 2005»
15 years 6 months ago
The problem of synthetically generating IP traffic matrices: initial recommendations
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
Antonio Nucci, Ashwin Sridharan, Nina Taft
INFOCOM
2011
IEEE
14 years 10 months ago
A prior-free revenue maximizing auction for secondary spectrum access
—Dynamic spectrum allocation has proven promising for mitigating the spectrum scarcity problem. In this model, primary users lease chunks of under-utilized spectrum to secondary ...
Ajay Gopinathan, Zongpeng Li
KDD
2012
ACM
199views Data Mining» more  KDD 2012»
13 years 9 months ago
Trustworthy online controlled experiments: five puzzling outcomes explained
Online controlled experiments are often utilized to make datadriven decisions at Amazon, Microsoft, eBay, Facebook, Google, Yahoo, Zynga, and at many other companies. While the th...
Ron Kohavi, Alex Deng, Brian Frasca, Roger Longbot...
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
16 years 9 days ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...