Results 1  10
of
6,397
The capacity of wireless networks
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2000
"... When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally p ..."
Abstract

Cited by 3243 (42 self)
 Add to MetaCart
When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally
Impulses and Physiological States in Theoretical Models of Nerve Membrane
 Biophysical Journal
, 1961
"... ABSTRACT Van der Pol's equation for a relaxation oscillator is generalized by the addition of terms to produce a pair of nonlinear differential equations with either a stable singular point or a limit cycle. The resulting "BVP model " has two variables of state, representing excitabi ..."
Abstract

Cited by 505 (0 self)
 Add to MetaCart
can be divided into regions corresponding to the physiological states of nerve fiber (resting, active, refractory, enhanced, depressed, etc.) to form a "physiological state diagram, " with the help of which many physiological phenomena can be summarized. A properly chosen projection from
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
likelihood weighting 3.1 The PYRAMID network All nodes were binary and the conditional probabilities were represented by tablesentries in the conditional probability tables (CPTs) were chosen uniformly in the range (0, 1]. 3.2 The toyQMR network All nodes were binary and the conditional probabilities
What is the Set of Images of an Object Under All Possible Lighting Conditions
 IEEE CVPR
, 1996
"... The appearance of a particular object depends on both the viewpoint from which it is observed and the light sources by which it is illuminated. If the appearance of two objects is never identical for any pose or lighting conditions, then in theory the objects can always be distinguished or recogni ..."
Abstract

Cited by 389 (25 self)
 Add to MetaCart
that the cone for a particular object can be constructed from three properly chosen images. Finally, we prove that the set of npixel images of an object of any shape and with an arbitrary reflectance function, seen under all possible illumination conditions, still forms a convex cone in Rn. Th.ese results
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
, 2003
"... The random waypoint model is a commonly used mobility model in the simulation of ad hoc networks. It is known that the spatial distribution of network nodes moving according to this model is, in general, nonuniform. However, a closedform expression of this distribution and an indepth investigation ..."
Abstract

Cited by 377 (10 self)
 Add to MetaCart
The random waypoint model is a commonly used mobility model in the simulation of ad hoc networks. It is known that the spatial distribution of network nodes moving according to this model is, in general, nonuniform. However, a closedform expression of this distribution and an in
Experienceweighted Attraction Learning in Normal Form Games
 ECONOMETRICA
, 1999
"... We describe a general model, `experienceweighted attraction' (EWA) learning, which includes reinforcement learning and a class of weighted fictitious play belief models as special cases. In EWA, strategies have attractions which reflect prior predispositions, are updated based on payoff experi ..."
Abstract

Cited by 279 (27 self)
 Add to MetaCart
experience, and determine choice probabilities according to some rule (e.g., logit). A key feature is a parameter delta which weights the strength of hypothetical reinforcement of strategies which were not chosen according to the payoff they would have yielded. When delta = 0 choice reinforcement results
NonMalleable NonInteractive Zero Knowledge and Adaptive ChosenCiphertext Security
, 1999
"... We introduce the notion of nonmalleable noninteractive zeroknowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong nonmalleability properties. We then show that the elegant encryption scheme of Naor and Yung [NY] can be made secure against ..."
Abstract

Cited by 187 (18 self)
 Add to MetaCart
the strongest form of chosenciphertext attack by using a nonmalleable NIZK proof instead of a standard NIZK proof. Our encryption scheme is simple to describe and works in the standard cryptographic model under general assumptions. The encryption scheme can be realized assuming the existence of trapdoor
Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
, 2010
"... Stochastic subgradient methods are widely used, well analyzed, and constitute effective tools for optimization and online learning. Stochastic gradient methods ’ popularity and appeal are largely due to their simplicity, as they largely follow predetermined procedural schemes. However, most common s ..."
Abstract

Cited by 311 (3 self)
 Add to MetaCart
, in essence, allows us to find needles in haystacks in the form of very predictive but rarely seenfeatures. Ourparadigmstemsfromrecentadvancesinstochasticoptimizationandonlinelearning which employ proximal functions to control the gradient steps of the algorithm. We describe and analyze an apparatus
Protecting Poorly Chosen Secrets from Guessing Attacks
, 1993
"... In a security system that allows people to choose their own passwords, those people tend to choose passwords that can be easily guessed. This weakness exists in practically all widely used systems. Instead of forcing users to choose wellchosen secrets, which are likely to be di cult to remember, ..."
Abstract

Cited by 138 (6 self)
 Add to MetaCart
In a security system that allows people to choose their own passwords, those people tend to choose passwords that can be easily guessed. This weakness exists in practically all widely used systems. Instead of forcing users to choose wellchosen secrets, which are likely to be di cult to remember
IMPORTANT: A framework to systematically analyze the Impact of Mobility on Performance of RouTing protocols for Adhoc NeTworks
 IEEE INFOCOM
, 2003
"... Abstract — A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any existing infrastructure. Since not many MANETs are currently deployed, research in this area is mostly simulation based. Random Waypoint is the commonly used mobility mod ..."
Abstract

Cited by 299 (18 self)
 Add to MetaCart
Abstract — A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any existing infrastructure. Since not many MANETs are currently deployed, research in this area is mostly simulation based. Random Waypoint is the commonly used mobility
Results 1  10
of
6,397