1511 search results - page 244 / 303 » Randomness, lowness and degrees |
131
click to vote
SIGMETRICS
2002
ACM
15 years 5 months ago
2002
ACM
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...
177
click to vote
TCAD
2008
15 years 5 months ago
2008
Abstract--This paper proposes an adaptive watermarking technique by modulating some closed cones in an originally optimized logic network (master design) for technology mapping. Th...
135
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract—We derive a simple general parametric representation of the rate–distortion function of a memoryless source, where both the rate and the distortion are given by integr...
175
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
149
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—By allowing routers to randomly mix the information content in packets before forwarding them, network coding can maximize network throughput in a distributed manner wit...