Sciweavers

736 search results - page 115 / 148
» Approximating the Number of Network Motifs
Sort
View
SIGMETRICS
2002
ACM
128views Hardware» more  SIGMETRICS 2002»
14 years 9 months ago
High-density model for server allocation and placement
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
Craig W. Cameron, Steven H. Low, David X. Wei
TRANSCI
2010
128views more  TRANSCI 2010»
14 years 8 months ago
An Information-Theoretic Sensor Location Model for Traffic Origin-Destination Demand Estimation Applications
To design a transportation sensor network, the decision-maker needs to determine what sensor investments should be made, as well as when, how, where and with what technologies. Th...
Xuesong Zhou, George F. List
WECWIS
2009
IEEE
104views ECommerce» more  WECWIS 2009»
15 years 4 months ago
Online Auctions: There Can Be Only One
—In recent years, the proliferation of the world wide web has lead to an increase in the number of public auctions on the internet. One of the characteristics of online auctions ...
Charu C. Aggarwal, Philip S. Yu
INFOCOM
2008
IEEE
15 years 4 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel
HPDC
2007
IEEE
15 years 4 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura