Results 11  20
of
18,662
Query by Committee
, 1992
"... We propose an algorithm called query by committee, in which a committee of students is trained on the same data set. The next query is chosen according to the principle of maximal disagreement. The algorithm is studied for two toy models: the highlow game and perceptron learning of another perceptr ..."
Abstract

Cited by 432 (3 self)
 Add to MetaCart
gain approaches zero and the generalization error decreases with a relatively slow inverse power law. We suggest that asymptotically finite information gain may be an important characteristic of good query algorithms.
Alphapower Law MOSFET Model and its Applications to CMOS Inverter Delay and other Formulas
 IEEE J. of SolidState Circs
, 1990
"... Abstract — A simple yet realistic MOS model, namely the apower law MOS model, is introduced to include the carrier velocity saturation effect, which becomes eminent in shortchannel MOSFET’S. The model is an extension of Shockley’s squarelaw MOS model in the saturation region. Since the model is s ..."
Abstract

Cited by 377 (10 self)
 Add to MetaCart
Abstract — A simple yet realistic MOS model, namely the apower law MOS model, is introduced to include the carrier velocity saturation effect, which becomes eminent in shortchannel MOSFET’S. The model is an extension of Shockley’s squarelaw MOS model in the saturation region. Since the model
Mapping the Gnutella network: Properties of largescale peertopeer systems and implications for system design
 IEEE Internet Computing Journal
, 2002
"... Despite recent excitement generated by the peertopeer (P2P) paradigm and the surprisingly rapid deployment of some P2P applications, there are few quantitative evaluations of P2P systems behavior. The open architecture, achieved scale, and selforganizing structure of the Gnutella network make it ..."
Abstract

Cited by 361 (23 self)
 Add to MetaCart
, reliability, and scalability. We have built a “crawler” to extract the topology of Gnutella’s application level network. In this paper we analyze the topology graph and evaluate generated network traffic. Our two major findings are that: (1) although Gnutella is not a pure powerlaw network, its current
On Distinguishing between Internet Power Law Topology Generators
, 2002
"... Recent work has shown that the node degree in the WWW induced graph and the ASlevel Internet topology exhibit power laws. Since then several algorithms have been proposed to generate such power law graphs. In this paper we evaluate the effectiveness of these generators to generate representative AS ..."
Abstract

Cited by 256 (4 self)
 Add to MetaCart
Recent work has shown that the node degree in the WWW induced graph and the ASlevel Internet topology exhibit power laws. Since then several algorithms have been proposed to generate such power law graphs. In this paper we evaluate the effectiveness of these generators to generate representative
On the Effectiveness of RouteBased Packet Filtering for Distributed DoS Attack Prevention in PowerLaw Internets
 In Proc. ACM SIGCOMM
, 2001
"... Denial of service (DoS) attack on the Internet has become a pressing problem. In this paper, we describe and evaluate routebased distributed packet filtering (DPF), a novel approach to distributed DoS (DDoS) attack prevention. We show that DPF achieves proactiveness and scalability, and we show tha ..."
Abstract

Cited by 278 (7 self)
 Add to MetaCart
by implementing routebased filtering on less than 20% of Internet autonomous system (AS) sites. Second, we show that the two complementary performance measures are dependent on the properties of the underlying AS graph. In particular, we show that the powerlaw structure of Internet AS topology leads
Characteristics of WWW Clientbased Traces
, 1995
"... The explosion of WWW traffic necessitates an accurate picture of WWW use, and in particular requires a good understanding of client requests for WWW documents. To address this need, we have collectedtraces of actual executions of NCSA Mosaic, reflecting over half a million user requests for WWW docu ..."
Abstract

Cited by 313 (31 self)
 Add to MetaCart
characteristics of WWW use can be modelled using powerlaw distributions, including the distribution of document sizes, the popularity of documents as a function of size, the distribution of user requests for documents, and the number of references to documents as a function of their overall rank in popularity
On the Origins of Power Laws in Internet Topologies
 39th Annual Allerton Conference on Communication, Control, and Computing, 2001 www.merit.edu/~mrt
"... Recent empirical studies [6] have shown that Internet topologies exhibit power laws of the form � for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; (P3) number of node pairs within a neighborhood versus neighborhood size (i ..."
Abstract

Cited by 220 (4 self)
 Add to MetaCart
Recent empirical studies [6] have shown that Internet topologies exhibit power laws of the form � for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; (P3) number of node pairs within a neighborhood versus neighborhood size
The Average Distance in a Random Graph with Given Expected Degrees
"... Random graph theory is used to examine the “smallworld phenomenon”– any two strangers are connected through a short chain of mutual acquaintances. We will show that for certain families of random graphs with given expected degrees, the average distance is almost surely of order log n / log ˜ d whe ..."
Abstract

Cited by 289 (13 self)
 Add to MetaCart
where ˜ d is the weighted average of the sum of squares of the expected degrees. Of particular interest are power law random graphs in which the number of vertices of degree k is proportional to 1/k β for some fixed exponent β. For the case of β> 3, we prove that the average distance of the power law
PeertoPeer Architecture Case Study: Gnutella Network
, 2001
"... Despite recent excitement generated by the P2P paradigm and despite surprisingly fast deployment of some P2P applications, there are few quantitative evaluations of P2P systems behavior. Due to its' open architecture and achieved scale, Gnutella is an interesting P2P architecture case study. Gn ..."
Abstract

Cited by 274 (1 self)
 Add to MetaCart
, and scalability. We built a 'crawler' to extract the topology of Gnutella's application level network. In this' paper we analyze the topology graph and evaluate generated network traffic. We find that although Gnutella is' not a pure powerlaw network, its' current configuration has
Pocket Switched Networks and Human Mobility in Conference Environments
, 2005
"... Pocket Switched Networks (PSN) make use of both human mobility and local/global connectivity in order to transfer data between mobile users ’ devices. This falls under the Delay Tolerant Networking (DTN) space, focusing on the use of opportunistic networking. One key problem in PSN is in designing f ..."
Abstract

Cited by 272 (16 self)
 Add to MetaCart
forwarding algorithms which cope with human mobility patterns. We present an experiment measuring fortyone humans ’ mobility at the Infocom 2005 conference. The results of this experiment are similar to our previous experiments in corporate and academic working environments, in exhibiting a powerlaw
Results 11  20
of
18,662