Sciweavers

13214 search results - page 2305 / 2643
» Pseudorandomness for network algorithms
Sort
View
HIPC
2007
Springer
15 years 10 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
ICDM
2007
IEEE
151views Data Mining» more  ICDM 2007»
15 years 10 months ago
Combining Collective Classification and Link Prediction
The problems of object classification (labeling the nodes of a graph) and link prediction (predicting the links in a graph) have been largely studied independently. Commonly, obje...
Mustafa Bilgic, Galileo Namata, Lise Getoor
BIBE
2004
IEEE
15 years 10 months ago
Identifying the Combination of Genetic Factors that Determine Susceptibility to Cervical Cancer
Cervical cancer is common among women all over the world. Although infection with high-risk types of human papillomavirus (HPV) has been identified as the primary cause of cervical...
Jorng-Tzong Horng, Kai-Chih Hu, Li-Cheng Wu, Hsien...
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
15 years 10 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
ATAL
2006
Springer
15 years 10 months ago
Multi-agent based peer-to-peer information retrieval systems with concurrent search sessions
In cooperative peer-to-peer information retrieval systems, each node can be considered an intelligent agent and these agents work collectively to provide an information retrieval ...
Haizheng Zhang, Victor R. Lesser
« Prev « First page 2305 / 2643 Last » Next »