1059 search results - page 148 / 212 » Improved Algorithms via Approximations of Probability Distri... |
SIGCOMM
2006
ACM
14 years 2 months ago
2006
ACM
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
MDM
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we propose adaptive content-driven routing and data dissemination algorithms for intelligently routing search queries in a peer-to-peer network that supports mobile ...
DAC
2002
ACM
14 years 10 months ago
2002
ACM
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...