Results 1  10
of
654
Distributed spacetimecoded protocols for exploiting cooperative diversity in wireless networks
 IEEE TRANS. INF. THEORY
, 2003
"... We develop and analyze space–time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a m ..."
Abstract

Cited by 622 (5 self)
 Add to MetaCart
utilize a spacetime code to cooperatively relay to the destination. We demonstrate that these protocols achieve full spatial diversity in the number of cooperating terminals, not just the number of decoding relays, and can be used effectively for higher spectral efficiencies than repetitionbased schemes
Constraint propagation algorithms for temporal reasoning
 Readings in Qualitative Reasoning about Physical Systems
, 1986
"... Abstract: This paper revises and expands upon a paper presented by two of the present authors at AAAI 1986 [Vilain & Kautz 1986]. As with the original, this revised document considers computational aspects of intervalbased and pointbased temporal representations. Computing the consequences of t ..."
Abstract

Cited by 428 (5 self)
 Add to MetaCart
reasoning; of these, one of the most attractive is James Allen's algebra of temporal intervals [Allen 1983]. This representation scheme is particularly appealing for its simplicity and for its ease of implementation with constraint propagation algorithms. Reasoners based on
Distributed SpaceTime Coded Protocols for Exploiting Cooperative Diversity in Wireless Networks
 IEEE Trans. Inform. Theory
, 2003
"... Abstract — We develop and analyze spacetime coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another i ..."
Abstract

Cited by 333 (10 self)
 Add to MetaCart
schemes. We discuss issues related to spacetime code design for these protocols, emphasizing codes that readily allow for appealing distributed versions. I.
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
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
The Variational Formulation of the FokkerPlanck Equation
 SIAM J. Math. Anal
, 1999
"... The FokkerPlanck equation, or forward Kolmogorov equation, describes the evolution of the probability density for a stochastic process associated with an Ito stochastic differential equation. It pertains to a wide variety of timedependent systems in which randomness plays a role. In this paper, ..."
Abstract

Cited by 282 (22 self)
 Add to MetaCart
of this iterative scheme is that the time step is governed by the Wasserstein metric on probability measures. This formulation enables us to reveal an appealing, and previously unexplored, relationship between the FokkerPlanck equation and the associated free energy functional. Namely, we demonstrate
Approximation schemes for Euclidean kMedians And Related Problems
 In Proc. 30th Annu. ACM Sympos. Theory Comput
, 1998
"... In the kmedian problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances from each of the points of S to the nearest median is minimized. This paper gives an approximation scheme for the plane that ..."
Abstract

Cited by 142 (3 self)
 Add to MetaCart
In the kmedian problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances from each of the points of S to the nearest median is minimized. This paper gives an approximation scheme for the plane
A duality based approach for realtime tvl1 optical flow
 In Ann. Symp. German Association Patt. Recogn
, 2007
"... Abstract. Variational methods are among the most successful approaches to calculate the optical flow between two image frames. A particularly appealing formulation is based on total variation (TV) regularization and the robust L 1 norm in the data fidelity term. This formulation can preserve discont ..."
Abstract

Cited by 198 (15 self)
 Add to MetaCart
Abstract. Variational methods are among the most successful approaches to calculate the optical flow between two image frames. A particularly appealing formulation is based on total variation (TV) regularization and the robust L 1 norm in the data fidelity term. This formulation can preserve
Accounting for the force of the appeal to authority
"... ABSTRACT: As appeals to expert authority shift from “fallacies ” to “argument schemes, ” argumentation theorists are called on to provide critical questions for assessing them. I argue that current treatments focus too heavily on assessing expertise, and not enough on judging trustworthiness. I prop ..."
Abstract
 Add to MetaCart
ABSTRACT: As appeals to expert authority shift from “fallacies ” to “argument schemes, ” argumentation theorists are called on to provide critical questions for assessing them. I argue that current treatments focus too heavily on assessing expertise, and not enough on judging trustworthiness. I
On the Analysis of Randomized Load Balancing Schemes
 IN PROCEEDINGS OF THE 9TH ANNUAL ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES
, 1998
"... It is well known that simple randomized load balancing schemes can balance load effectively while incurring only a small overhead, making such schemes appealing for practical systems. In this paper, we provide new analyses for several such dynamic randomized load balancing schemes. Our work extends ..."
Abstract

Cited by 59 (7 self)
 Add to MetaCart
It is well known that simple randomized load balancing schemes can balance load effectively while incurring only a small overhead, making such schemes appealing for practical systems. In this paper, we provide new analyses for several such dynamic randomized load balancing schemes. Our work extends
DrScheme: A Pedagogic Programming Environment for Scheme
 In Proc. International Symposium on Programming Languages: Implementations, Logics, and Programs
, 1997
"... . Teaching introductory computing courses with Scheme elevates the intellectual level of the course and thus makes the subject more appealing to students with scientific interests. Unfortunately, the poor quality of the available programming environments negates many of the pedagogic advantages. To ..."
Abstract

Cited by 69 (24 self)
 Add to MetaCart
. Teaching introductory computing courses with Scheme elevates the intellectual level of the course and thus makes the subject more appealing to students with scientific interests. Unfortunately, the poor quality of the available programming environments negates many of the pedagogic advantages
Results 1  10
of
654