Sciweavers

104 search results - page 14 / 21
» Nodes of large degree in random trees and forests
Sort
View
BROADNETS
2007
IEEE
14 years 3 months ago
DIMPLE: DynamIc Membership ProtocoL for epidemic protocols
—Epidemic protocols assume that information of a random set of nodes is provided at each protocol round. By definition, the random set needs to be chosen uniformly and randomly ...
Jin Sun, Paul J. Weber, Byung Kyu Choi, Roger M. K...
COMBINATORICS
2000
84views more  COMBINATORICS 2000»
13 years 8 months ago
A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large
We study the limiting distribution of the height in a generalized trie in which external nodes are capable to store up to b items (the so called b-tries). We assume that such a tr...
Charles Knessl, Wojciech Szpankowski
ICDE
2009
IEEE
152views Database» more  ICDE 2009»
14 years 10 months ago
Tree Indexing on Flash Disks
Abstract-- Large flash disks have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption and other features. How...
Yinan Li, Bingsheng He, Qiong Luo, Ke Yi
TMC
2011
131views more  TMC 2011»
13 years 3 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
CVPR
2011
IEEE
13 years 4 months ago
Coupled Information-Theoretic Encoding for Face Photo-Sketch Recognition
Automatic face photo-sketch recognition has important applications to law enforcement. Recent research has focused on transforming photos and sketches into the same modality for m...
Wei Zhang, Xiaogang Wang, Xiaoou Tang