Sciweavers

7628 search results - page 165 / 1526
» Spatial P systems
Sort
View
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
15 years 5 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
NBIS
2009
Springer
15 years 8 months ago
A Security Framework for JXTA-Overlay
At present time, the maturity of P2P research field has pushed through new problems such us those related with security. For that reason, security starts to become one of the key...
Joan Arnedo-Moreno, Keita Matsuo, Leonard Barolli,...
MUM
2004
ACM
154views Multimedia» more  MUM 2004»
15 years 9 months ago
Plug-and-play application platform: towards mobile peer-to-peer
While peer-to-peer (P2P) has emerged as a new hot communication concept among the Internet users, mobile usage of P2P applications is still taking its first steps. This article fi...
Erkki Harjula, Mika Ylianttila, Jussi Ala-Kurikka,...
ICC
2007
IEEE
143views Communications» more  ICC 2007»
15 years 10 months ago
Application-Aware Topology Formation Algorithm for Peer-to-Peer Networks
—When constructing an unstructured P2P topology, one should consider the application running on top of it in order to achieve a good performance for the whole P2P system. It is n...
Kin Wah Kwong, Danny H. K. Tsang
NOSSDAV
2005
Springer
15 years 9 months ago
Peer-to-peer internet telephony using SIP
P2P systems inherently have high scalability, robustness and fault tolerance because there is no centralized server and the network self-organizes itself. This is achieved at the ...
Kundan Singh, Henning Schulzrinne