Results 1  10
of
14,691
Stable Fluids
, 1999
"... Building animation tools for fluidlike motions is an important and challenging problem with many applications in computer graphics. The use of physicsbased models for fluid flow can greatly assist in creating such tools. Physical models, unlike key frame or procedural based techniques, permit an a ..."
Abstract

Cited by 568 (9 self)
 Add to MetaCart
to the fact that previous models used unstable schemes to solve the physical equations governing a fluid. In this paper, for the first time, we propose an unconditionally stable model which still produces complex fluidlike flows. As well, our method is very easy to implement. The stability of our model
Cooperative diversity in wireless networks: efficient protocols and outage behavior
 IEEE TRANS. INFORM. THEORY
, 2004
"... We develop and analyze lowcomplexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals’ relaying signals for one another. We outline several strategies ..."
Abstract

Cited by 2009 (31 self)
 Add to MetaCart
employed by the cooperating radios, including fixed relaying schemes such as amplifyandforward and decodeandforward, selection relaying schemes that adapt based upon channel measurements between the cooperating terminals, and incremental relaying schemes that adapt based upon limited feedback from
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2825 (11 self)
 Add to MetaCart
We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
 Journal of the ACM
, 1998
"... Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes ..."
Abstract

Cited by 397 (2 self)
 Add to MetaCart
Abstract. We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed c Ͼ 1 and given any n nodes in 2 , a randomized version of the scheme finds a (1 ϩ 1/c)approximation to the optimum traveling salesman tour in O(n(log n) O(c) ) time. When the nodes
MultiChannel MAC for Ad Hoc Networks: Handling MultiChannel Hidden Terminals Using a Single Transceiver
 In ACM MobiHoc
, 2004
"... This paper proposes a medium access control (MAC) protocol for ad hoc wireless networks that utilizes multiple channels dynamically to improve performance. The IEEE 802.11 standard allows for the use of multiple channels available at the physical layer, but its MAC protocol is designed only for a si ..."
Abstract

Cited by 431 (6 self)
 Add to MetaCart
This paper proposes a medium access control (MAC) protocol for ad hoc wireless networks that utilizes multiple channels dynamically to improve performance. The IEEE 802.11 standard allows for the use of multiple channels available at the physical layer, but its MAC protocol is designed only for a
Control of Systems Integrating Logic, Dynamics, and Constraints
 Automatica
, 1998
"... This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as Mixed Logical Dynamical (MLD) systems. These are described by linear dynamic equations subject to linear inequalities involving real and ..."
Abstract

Cited by 413 (50 self)
 Add to MetaCart
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as Mixed Logical Dynamical (MLD) systems. These are described by linear dynamic equations subject to linear inequalities involving real
Efficient Fair Queuing using Deficit Round Robin
 SIGCOMM '95
, 1995
"... Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work required to process a packet in these schemes was ..."
Abstract

Cited by 359 (4 self)
 Add to MetaCart
Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work required to process a packet in these schemes
On the capacity of MIMO broadcast channel with partial side information
 IEEE TRANS. INFORM. THEORY
, 2005
"... In multipleantenna broadcast channels, unlike pointtopoint multipleantenna channels, the multiuser capacity depends heavily on whether the transmitter knows the channel coefficients to each user. For instance, in a Gaussian broadcast channel with transmit antennas and singleantenna users, the ..."
Abstract

Cited by 349 (9 self)
 Add to MetaCart
to the transmitter with very little feedback. For fixed and increasing, the throughput of our scheme scales as log log, where is the number of receive antennas of each user. This is precisely the same scaling obtained with perfect CSI using dirty paper coding. We furthermore show that a linear increase in throughput
Broadcast Encryption
, 1994
"... We introduce new theoretical measures for the qualitative and quantitative assessment of encryption schemes designed for broadcast transmissions. The goal is to allow a central broadcast site to broadcast secure transmissions to an arbitrary set of recipients while minimizing key management related ..."
Abstract

Cited by 331 (8 self)
 Add to MetaCart
transmissions. We present several schemes that allow a center to broadcast a secret to any subset of privileged users out of a universe of size n so that coalitions of k users not in the privileged set cannot learn the secret. The most interesting scheme requires every user to store O(k log k log n) keys
Renormalization in quantum field theory and the RiemannHilbert problem. II. The βfunction, diffeomorphisms and the renormalization group
 Comm. Math. Phys
"... We show that renormalization in quantum field theory is a special instance of a general mathematical procedure of multiplicative extraction of finite values based on the Riemann–Hilbert problem. Given a loop γ(z), z  = 1 of elements of a complex Lie group G the general procedure is given by evalu ..."
Abstract

Cited by 332 (39 self)
 Add to MetaCart
(where z is now the deviation from 4 of the complex dimension) of elements of the decorated Butcher group (obtained using the MilnorMoore theorem from the Kreimer Hopf algebra of renormalization) and that the above general procedure delivers the renormalized physical theory in the minimal substraction
Results 1  10
of
14,691