Sciweavers

844 search results - page 8 / 169
» Solving the p
Sort
View
SEKE
2007
Springer
15 years 3 months ago
Managing XML Versions and Replicas in a P2P Context
Peer-to-Peer (P2P) systems seek to provide sharing of computational resources, which may be duplicated or versioned over several peers. Duplicate resources (i.e. replicas) are the...
Deise de Brum Saccol, Nina Edelweiss, Renata de Ma...
SIGMETRICS
2006
ACM
15 years 3 months ago
Fluid modeling of pollution proliferation in P2P networks
P2P systems are highly vulnerable to pollution attacks in which attackers inject multiple versions of corrupted content into the system, which is then further proliferated by unsu...
Rakesh Kumar, David D. Yao, Amitabha Bagchi, Keith...
AUSAI
2009
Springer
15 years 4 months ago
Probabilistic Seeking Prediction in P2P VoD Systems
In P2P VoD streaming systems, user behavior modeling is critical to help optimise user experience as well as system throughput. However, it still remains a challenging task due to ...
Weiwei Wang, Tianyin Xu, Yang Gao, Sanglu Lu
67
Voted
INFOCOM
2007
IEEE
15 years 3 months ago
Information Survival Threshold in Sensor and P2P Networks
— Consider a network of, say, sensors, or P2P nodes, or bluetooth-enabled cell-phones, where nodes transmit information to each other and where links and nodes can go up or down....
Deepayan Chakrabarti, Jure Leskovec, Christos Falo...
65
Voted
MOC
1998
65views more  MOC 1998»
14 years 9 months ago
Solving constrained Pell equations
Consider the system of Diophantine equations x2 − ay2 = b, P (x, y) = z2, where P is a given integer polynomial. Historically, such systems have been analyzed by using Baker’s ...
Kiran S. Kedlaya