2569 search results - page 130 / 514 » Approximate Objects and Approximate Theories |
149
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...
160
click to vote
CJ
2004
15 years 6 months ago
2004
act interpretation. R. Barbuti, C. Bernardeschi and N. De Francesco With mobile technology more and more prominent, the problem of security leakages becomes more and more important...
185
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
155
click to vote
TIT
2002
15 years 6 months ago
2002
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
166
click to vote
TON
2010
15 years 4 months ago
2010
Abstract—Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant...