Sciweavers

4075 search results - page 159 / 815
» Modeling Distributed Algorithm Using B
Sort
View
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
15 years 4 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson
IPMI
2005
Springer
16 years 1 months ago
Multi-object Segmentation Using Shape Particles
Deformable template models, in which a shape model and its corresponding appearance model are deformed to optimally fit an object in the image, have proven successful in many medic...
Marleen de Bruijne, Mads Nielsen
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
15 years 6 days ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger
TCOM
2008
126views more  TCOM 2008»
15 years 14 days ago
Distributed measurements for estimating and updating cellular system performance
We investigate the use of distributed measurements for estimating and updating the performance of a cellular system. Specifically, we discuss the number and placement of sensors in...
Liang Xiao, Larry J. Greenstein, Narayan B. Manday...
INFOCOM
2008
IEEE
15 years 7 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff