Sciweavers

1982 search results - page 23 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
WAW
2007
Springer
89views Algorithms» more  WAW 2007»
15 years 3 months ago
Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet
Traceroute sampling is an important technique in exploring the internet router graph and the autonomous system graph. Although it is one of the primary techniques used in calculati...
Abraham D. Flaxman, Juan Vera
88
Voted
UAI
2008
14 years 11 months ago
Small Sample Inference for Generalization Error in Classification Using the CUD Bound
Confidence measures for the generalization error are crucial when small training samples are used to construct classifiers. A common approach is to estimate the generalization err...
Eric Laber, Susan Murphy
TOCS
2008
107views more  TOCS 2008»
14 years 9 months ago
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership...
Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot
SIGGRAPH
1998
ACM
15 years 1 months ago
A Perceptually Based Adaptive Sampling Algorithm
A perceptually based approach for selecting image samples has been developed. An existing image processing vision model has been extended to handle color and has been simplified ...
Mark R. Bolin, Gary W. Meyer
CONPAR
1992
15 years 1 months ago
Analysis of an Efficient Distributed Algorithm for Mutual Exclusion (Average-Case Analysis of Path Reversal)
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Christian Lavault