2084 search results - page 288 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
150
click to vote
SPAA
2006
ACM
15 years 11 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
146
Voted
DKE
2008
15 years 5 months ago
2008
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...
118
Voted
IPL
2008
15 years 5 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
138
Voted
SIGECOM
2005
ACM
15 years 10 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
144
Voted
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...