Sciweavers

1034 search results - page 207 / 207
» Universal Routing and Performance Assurance for Distributed ...
Sort
View
PODC
2009
ACM
14 years 5 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
ICDCSW
2008
IEEE
13 years 11 months ago
On Feasibility of P2P On-Demand Streaming via Empirical VoD User Behavior Analysis
—In its current art, peer-to-peer streaming solution has been mainly employed in the domain of live event broadcasting. In such a paradigm, users are required to simultaneously p...
Bin Chang, Liang Dai, Yi Cui, Yuan Xue
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
13 years 9 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
SIMUTOOLS
2008
13 years 6 months ago
Simulating SMEPP middleware
Embedded Peer-to-Peer Systems (EP2P) represent a new challenge in the development of software for distributed systems. The main objective of the SMEPP (Secure Middleware for Embed...
Javier Barbarán, Carlos Bonilla, Jose &Aacu...