8377 search results - page 1508 / 1676 » Scenarios - Introduction |
158
click to vote
IPSN
2005
Springer
16 years 1 days ago
2005
Springer
Geographic routing with greedy relaying strategies have been widely studied as a routing scheme in sensor networks. These schemes assume that the nodes have perfect information ab...
184
click to vote
ISAAC
2005
Springer
16 years 1 days ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
161
click to vote
IWQOS
2005
Springer
16 years 1 days ago
2005
Springer
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and pr...
190
click to vote
KDD
2005
ACM
16 years 1 days ago
2005
ACM
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...
167
click to vote
KDD
2005
ACM
16 years 1 days ago
2005
ACM
A lift curve, with the true positive rate on the y-axis and the customer pull (or contact) rate on the x-axis, is often used to depict the model performance in many data mining ap...