3047 search results - page 370 / 610 » Randomized Parallel Selection |
123
click to vote
SIGECOM
2009
ACM
15 years 9 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
165
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
139
click to vote
SIGMOD
1998
ACM
15 years 7 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
121
click to vote
APNOMS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Recently, researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The Bounded Random Drop (BRD), known...
130
click to vote
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...