Results 1  10
of
9,740
Random Early Detection Gateways for Congestion Avoidance.
 IEEELACM Transactions on Networking,
, 1993
"... AbstractThis paper presents Random Early Detection (RED) gateways for congestion avoidance in packetswitched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract

Cited by 2716 (31 self)
 Add to MetaCart
. However, it would clearly be undesirable to have large queues (possibly on the order of a delay bandwidth product) that were full much of the time; this would significantly increase the average delay in the network. Therefore, with increasingly highspeed networks, it is increasingly important to have
Spacetime block codes from orthogonal designs
 IEEE Trans. Inform. Theory
, 1999
"... Abstract — We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into � streams which are simultaneously transmitted using � transmit antennas. ..."
Abstract

Cited by 1524 (42 self)
 Add to MetaCart
possible transmission rate using arbitrary complex constellations. The best tradeoff between the decoding delay and the number of transmit antennas is also computed and it is shown that many of the codes presented here are optimal in this sense as well. Index Terms — Codes, diversity, multipath channels
An Efficient Solution to the FivePoint Relative Pose Problem
, 2004
"... An efficient algorithmic solution to the classical fivepoint relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth degre ..."
Abstract

Cited by 484 (13 self)
 Add to MetaCart
An efficient algorithmic solution to the classical fivepoint relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth
Equation and test of possible delay time of Newton force
"... Abstract. Recently, a simple heuristic modification of the Newton potential with a nonzero delaytime τG has been proposed. Our modification is largely suppressed for purely gravitational interactions, it becomes relevant under nongravitational accelerations of the sources. We illustrate how the c ..."
Abstract
 Add to MetaCart
Abstract. Recently, a simple heuristic modification of the Newton potential with a nonzero delaytime τG has been proposed. Our modification is largely suppressed for purely gravitational interactions, it becomes relevant under nongravitational accelerations of the sources. We illustrate how
On visible surface generation by a priori tree structures
 Computer Graphics
, 1980
"... This paper describes a new algorithm for solving the hidden surface (or line) problem, to more rapidly generate realistic images of 3D scenes composed of polygons, and presents the development of theoretical foundations in the area as well as additional related algorithms. As in many applications t ..."
Abstract

Cited by 370 (6 self)
 Add to MetaCart
environment is static with only the viewingposition changing, as is common in simulation, the results presented will be safficient to solve completely tlae llidden surface proulem.;_N~a~OUCZZON One of the longterm goals of computer graphics has been, and continues to be, the rapid, possibly real
Explaining Bargaining Impasse: The Role of SelfServing Biases
 Journal of Economic Perspectives
, 1997
"... We review studies conducted by ourselves and coauthors that document a "selfserving " bias in judgments of fairness and demonstrate that the bias is an important cause of impasse in negotiations. We discuss experimental evidence showing that (a) the bias causes impasse; (b) it is possible ..."
Abstract

Cited by 349 (9 self)
 Add to MetaCart
) it is possible to reduce impasses by debiasing bargainers; and (c) the bias results from selective evaluation of information. We also review results from a field study of negotiations between teachers ' unions and school boards in Pennsylvania that both documents the fairness bias in a naturalistic setting
Logic Programming in a Fragment of Intuitionistic Linear Logic
, 1994
"... When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ..."
Abstract

Cited by 340 (44 self)
 Add to MetaCart
there is an exponential number of such splits, it is important to delay the choice of a split as much as possible. A mechanism for the lazy splitting of contexts is presented based on viewing proof search as a process that takes a context, consumes part of it, and returns the rest (to be consumed elsewhere). In addition
ModelChecking in Dense Realtime
 INFORMATION AND COMPUTATION
, 1993
"... Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends on t ..."
Abstract

Cited by 327 (7 self)
 Add to MetaCart
on the magnitudes of the timing delays. For specifications, we extend the syntax of CTL to allow quantitative temporal operators such as 93!5 , meaning "possibly within 5 time units." The formulas of the resulting logic, Timed CTL (TCTL), are interpreted over continuous computation trees, trees in which
Blind separation of speech mixtures via timefrequency masking
 IEEE TRANSACTIONS ON SIGNAL PROCESSING (2002) SUBMITTED
, 2004
"... Binary timefrequency masks are powerful tools for the separation of sources from a single mixture. Perfect demixing via binary timefrequency masks is possible provided the timefrequency representations of the sources do not overlap: a condition we calldisjoint orthogonality. We introduce here t ..."
Abstract

Cited by 322 (5 self)
 Add to MetaCart
Binary timefrequency masks are powerful tools for the separation of sources from a single mixture. Perfect demixing via binary timefrequency masks is possible provided the timefrequency representations of the sources do not overlap: a condition we calldisjoint orthogonality. We introduce here
Results 1  10
of
9,740