Sciweavers

3809 search results - page 659 / 762
» Randomized Broadcast in Networks
Sort
View
CCR
2006
117views more  CCR 2006»
13 years 9 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
ENTCS
2006
124views more  ENTCS 2006»
13 years 9 months ago
A New Rabin-type Trapdoor Permutation Equivalent to Factoring
Public key cryptography has been invented to overcome some key management problems in open networks. Although nearly all aspects of public key cryptography rely on the existence of...
Katja Schmidt-Samoa
TKDE
2008
123views more  TKDE 2008»
13 years 9 months ago
Explaining Classifications For Individual Instances
We present a method for explaining predictions for individual instances. The presented approach is general and can be used with all classification models that output probabilities...
Marko Robnik-Sikonja, Igor Kononenko
CCR
2002
105views more  CCR 2002»
13 years 9 months ago
Adaptive packet sampling for flow volume measurement
Traffic measurement and monitoring are an important component of network management and traffic engineering. With high-speed Internet backbone links, efficient and effective packe...
Baek-Young Choi, Jaesung Park, Zhi-Li Zhang
MOR
2000
162views more  MOR 2000»
13 years 9 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan