776 search results - page 80 / 156 » Distributed Information Regularization on Graphs |
120
click to vote
ISAAC
2005
Springer
15 years 8 months 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...
141
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
104
click to vote
CHI
2008
ACM
16 years 3 months ago
2008
ACM
Informal analysis of many usability tests suggests that there is regularly one participant that is substantially slower than all the others. Moreover, such outliers are more extre...
120
click to vote
ISPDC
2006
IEEE
15 years 8 months ago
2006
IEEE
Recent applications for distributed mobile devices, including multimedia video/audio streaming, typically process streams of incoming data in a regular, predictable way. The behav...
142
click to vote
SIGSOFT
1994
ACM
15 years 7 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...