Sciweavers

353 search results - page 55 / 71
» Dynamic search in peer-to-peer networks
Sort
View
CIKM
2005
Springer
14 years 2 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...
SAC
2006
ACM
14 years 2 months ago
Evaluating unstructured peer-to-peer lookup overlays
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
Idit Keidar, Roie Melamed
WSC
2000
13 years 10 months ago
Cost/benefit analysis of interval jumping in power-control simulation
Computation of power control calculations is one of the most time-consuming aspects of simulating wireless communication systems. These calculations are critical to understanding ...
David M. Nicol, L. Felipe Perrone
IEEECIT
2010
IEEE
13 years 7 months ago
A Rotate-based Best Neighborhood Matching Algorithm for High Definition Image Error Concealment
—Error concealment restores the visual integrity of image content that has been damaged due to a bad network transmission. Best neighborhood matching (BNM) is an effective image ...
Liqiang He, Yanyan Zhang
EDBT
2008
ACM
194views Database» more  EDBT 2008»
14 years 9 months ago
XCraft: boosting the performance of active XML materialization
An active XML (AXML) document contains tags representing calls to Web services. Therefore, retrieving its contents consists in materializing its data elements by invoking the embe...
Gabriela Ruberg, Marta Mattoso