Sciweavers

8370 search results - page 208 / 1674
» Challenges in P2P Computing
Sort
View
ICC
2008
IEEE
126views Communications» more  ICC 2008»
15 years 11 months ago
Discovering Packet Structure through Lightweight Hierarchical Clustering
— The complexity of current Internet applications makes the understanding of network traffic a challenging task. By providing larger-scale aggregates for analysis, unsupervised ...
Abdulrahman Hijazi, Hajime Inoue, Ashraf Matrawy, ...
INFOCOM
2006
IEEE
15 years 10 months ago
Minimum User-Perceived Interference Routing in Service Composition
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
Li Xiao, Klara Nahrstedt
WWW
2003
ACM
15 years 9 months ago
Make it fresh, make it quick: searching a network of personal webservers
Personal webservers have proven to be a popular means of sharing files and peer collaboration. Unfortunately, the transient availability and rapidly evolving content on such host...
Mayank Bawa, Roberto J. Bayardo Jr., Sridhar Rajag...
DBKDA
2010
IEEE
127views Database» more  DBKDA 2010»
15 years 3 months ago
Failure-Tolerant Transaction Routing at Large Scale
—Emerging Web2.0 applications such as virtual worlds or social networking websites strongly differ from usual OLTP applications. First, the transactions are encapsulated in an AP...
Idrissa Sarr, Hubert Naacke, Stéphane Gan&c...
CIKM
2010
Springer
15 years 2 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...