Sciweavers

505 search results - page 97 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
13 years 8 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
13 years 9 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
TIP
2010
107views more  TIP 2010»
13 years 3 months ago
Risk-Distortion Analysis for Video Collusion Attacks: A Mouse-and-Cat Game
Copyright protection is a key issue for video sharing over public networks. To protect the video content from unauthorized redistribution, digital fingerprinting is commonly used. ...
Yan Chen, W. Sabrina Lin, K. J. Ray Liu
DAC
2006
ACM
14 years 9 months ago
Optimality study of resource binding with multi-Vdds
Deploying multiple supply voltages (multi-Vdds) on one chip is an important technique to reduce dynamic power consumption. In this work we present an optimality study for resource...
Deming Chen, Jason Cong, Yiping Fan, Junjuan Xu
INFOCOM
2009
IEEE
14 years 3 months ago
A Queueing Model Framework of PCE-Based Inter-Area Path Computation
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
Juanjuan Yu, Yue He, Kai Wu, Marco Tacca, Andrea F...