Sciweavers

460 search results - page 68 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
14 years 9 months ago
Progressive Distributed Top k Retrieval in Peer-to-Peer Networks
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uw...
COR
2010
146views more  COR 2010»
13 years 7 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
GPC
2007
Springer
14 years 1 months ago
Design of PeerSum: A Summary Service for P2P Applications
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
AP2PS
2009
IEEE
14 years 25 days ago
A Highly Robust P2P-CDN under Large-Scale and Dynamic Participation
—By building a P2P Content Distribution Network (CDN), peers collaborate to distribute the content of underprovisionned websites and to serve queries for larger audiences on beha...
Manal El Dick, Esther Pacitti, Bettina Kemme
HPCS
2005
IEEE
14 years 1 months ago
High Performance Derivative-Free Optimization Applied to Biomedical Image Registration
Abstract— Optimization of a similarity metric is an essential component in most medical image registration approaches based on image intensities. In this paper, two new, determin...
Mark P. Wachowiak, Terry M. Peters