Sciweavers

2434 search results - page 77 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
130
Voted
IPPS
2005
IEEE
15 years 9 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
154
Voted
JPDC
2006
187views more  JPDC 2006»
15 years 3 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
IPL
2008
82views more  IPL 2008»
15 years 3 months ago
A note on the distribution of the number of prime factors of the integers
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...
Aravind Srinivasan
135
Voted
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
16 years 18 days ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
DKE
2007
130views more  DKE 2007»
15 years 3 months ago
Enabling access-privacy for random walk based data analysis applications
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
Ping Lin, K. Selçuk Candan