Sciweavers

170 search results - page 2 / 34
» On the Probability of the Number of Solutions for the P4P Pr...
Sort
View
FCT
2007
Springer
13 years 11 months ago
A Novel Information Transmission Problem and Its Optimal Solution
We propose and study a new information transmission problem motivated by today’s internet. A real number, perhaps representing control information in a network, is encoded using...
Eric Bach, Jin-yi Cai
COMGEO
1999
ACM
13 years 5 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
13 years 10 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
COMCOM
2006
79views more  COMCOM 2006»
13 years 5 months ago
How many sensors for an acceptable breach detection probability?
Determining the required number of sensors to be deployed is a critical decision for surveillance wireless sensor networks. In this paper, we discuss the trade-off between the num...
Ertan Onur, Cem Ersoy, Hakan Deliç
FCT
2009
Springer
14 years 6 days ago
Martingales on Trees and the Empire Chromatic Number of Random Trees
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
Colin Cooper, Andrew R. A. McGrae, Michele Zito