Sciweavers

608 search results - page 83 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
COMCOM
2010
179views more  COMCOM 2010»
13 years 7 months ago
On the statistical characterization of flows in Internet traffic with application to sampling
A new method of estimating some statistical characteristics of TCP flows in the Internet is developed in this paper. For this purpose, a new set of random variables (referred to as...
Yousra Chabchoub, Christine Fricker, Fabrice Guill...
DKE
2006
67views more  DKE 2006»
13 years 7 months ago
Indexed-based density biased sampling for clustering applications
Density biased sampling (DBS) has been proposed to address the limitations of Uniform sampling, by producing the desired probability distribution in the sample. The ease of produc...
Alexandros Nanopoulos, Yannis Theodoridis, Yannis ...
TCS
2008
13 years 7 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger
JNW
2007
140views more  JNW 2007»
13 years 7 months ago
The Effect of Physical Topology on Wireless Sensor Network Lifetime
— Wireless sensor networks must measure environmental conditions, such as temperature, over extended periods and therefore require a long system lifetime. The design of long life...
Debdhanit Yupho, Joseph Kabara
ECCC
2000
93views more  ECCC 2000»
13 years 7 months ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
Maria Isabel Gonzalez Vasco, Igor Shparlinski