Sciweavers

848 search results - page 167 / 170
» Randomness and the linear degrees of computability
Sort
View
77
Voted
MMSEC
2004
ACM
137views Multimedia» more  MMSEC 2004»
15 years 2 months ago
Perturbed quantization steganography with wet paper codes
In this paper, we introduce a new approach to passive-warden steganography in which the sender embeds the secret message into a certain subset of the cover object without having t...
Jessica J. Fridrich, Miroslav Goljan, David Soukal
ADHOCNOW
2004
Springer
15 years 2 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
93
Voted
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
CDC
2008
IEEE
112views Control Systems» more  CDC 2008»
14 years 11 months ago
Information fusion strategies from distributed filters in packet-drop networks
Abstract-- In this paper we study different distributed estimation schemes for stochastic discrete time linear systems where the communication between the sensors and the estimatio...
Alessandro Chiuso, Luca Schenato
MASCOTS
2003
14 years 11 months ago
Minimizing Packet Loss by Optimizing OSPF Weights Using Online Simulation
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
Hema Tahilramani Kaur, Tao Ye, Shivkumar Kalyanara...