Sciweavers

622 search results - page 72 / 125
» Fast Computation of Large Distributions and Its Cryptographi...
Sort
View
IMC
2003
ACM
15 years 5 months ago
Virtual landmarks for the internet
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
Liying Tang, Mark Crovella
ICDCSW
2006
IEEE
15 years 5 months ago
The Bootstrapping Service
We outline a lightweight architecture to support novel application scenarios for P2P systems. These scenarios include merging and splitting of large networks, or multiplexing rela...
Márk Jelasity, Alberto Montresor, Özal...
ICDCS
1996
IEEE
15 years 4 months ago
Scaling Heterogeneous Databases and the Design of Disco
Access to large numbers of data sources introduces new problems for users of heterogeneous distributed databases. End users and application programmers must deal with unavailable ...
Anthony Tomasic, Louiqa Raschid, Patrick Valduriez
DCC
2009
IEEE
15 years 6 months ago
Tree Histogram Coding for Mobile Image Matching
For mobile image matching applications, a mobile device captures a query image, extracts descriptive features, and transmits these features wirelessly to a server. The server reco...
David M. Chen, Sam S. Tsai, Vijay Chandrasekhar, G...
BMCBI
2006
141views more  BMCBI 2006»
14 years 12 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...