Results 11  20
of
239,030
Policy gradient methods for reinforcement learning with function approximation.
 In NIPS,
, 1999
"... Abstract Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and determining a policy from it has so far proven theoretically intractable. In this paper we explore an alternative approach in which the policy is explicitly repres ..."
Abstract

Cited by 439 (20 self)
 Add to MetaCart
policy. Large applications of reinforcement learning (RL) require the use of generalizing function approximators such neural networks, decisiontrees, or instancebased methods. The dominant approach for the last decade has been the valuefunction approach, in which all function approximation effort goes
The Relationship Between PrecisionRecall and ROC Curves
 In ICML ’06: Proceedings of the 23rd international conference on Machine learning
, 2006
"... Receiver Operator Characteristic (ROC) curves are commonly used to present results for binary decision problems in machine learning. However, when dealing with highly skewed datasets, PrecisionRecall (PR) curves give a more informative picture of an algorithm’s performance. We show that a deep conn ..."
Abstract

Cited by 415 (4 self)
 Add to MetaCart
Receiver Operator Characteristic (ROC) curves are commonly used to present results for binary decision problems in machine learning. However, when dealing with highly skewed datasets, PrecisionRecall (PR) curves give a more informative picture of an algorithm’s performance. We show that a deep
A framework for clustering evolving data streams. In:
 Proc of VLDB’03,
, 2003
"... Abstract The clustering problem is a difficult problem for the data stream domain. This is because the large volumes of data arriving in a stream renders most traditional algorithms too inefficient. In recent years, a few onepass clustering algorithms have been developed for the data stream proble ..."
Abstract

Cited by 359 (36 self)
 Add to MetaCart
algorithm requires much greater functionality in discovering and exploring clusters over different portions of the stream. The widely used practice of viewing data stream clustering algorithms as a class of onepass clustering algorithms is not very useful from an application point of view. For example, a
Approximating the nondominated front using the Pareto Archived Evolution Strategy
 EVOLUTIONARY COMPUTATION
, 2000
"... We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its ..."
Abstract

Cited by 321 (19 self)
 Add to MetaCart
simplest form, is a (1 + 1) evolution strategy employing local search but using a reference archive of previously found solutions in order to identify the approximate dominance ranking of the current and candidate solution vectors. (1 + 1)PAES is intended to be a baseline approach against which more
On Loops, Dominators, and Dominance Frontiers
, 1999
"... This paper explores the concept of loops and loop nesting forests of controlflow graphs, using the problem of constructing the dominator tree of a graph and the problem of computing the iterated dominance frontier of a set of vertices in a graph as guiding applications. The contributions of this pa ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
This paper explores the concept of loops and loop nesting forests of controlflow graphs, using the problem of constructing the dominator tree of a graph and the problem of computing the iterated dominance frontier of a set of vertices in a graph as guiding applications. The contributions
On Loops, Dominators, and Dominance Frontiers
"... 1 Introduction This paper illustrates the use of loop nesting forests in two applications. The first is a new algorithm for computingthe iterated dominance frontier of a set of vertices in a graph, which can be used to construct representations such as the SSA form [7] and Sparse Evaluation Graphs [ ..."
Abstract
 Add to MetaCart
1 Introduction This paper illustrates the use of loop nesting forests in two applications. The first is a new algorithm for computingthe iterated dominance frontier of a set of vertices in a graph, which can be used to construct representations such as the SSA form [7] and Sparse Evaluation Graphs
Texture analysis and classification with treestructured wavelet transform
 IEEE TRANS. IMAGE PROCESSING
, 1993
"... One difficulty of texture analysis in the past was the lack of adequate tools to characterize different scales of textures effectively. Recent developments in multiresolution analysis such as the Gabor and wavelet transforms help to overcome this difficulty. In this research, we propose a multiresol ..."
Abstract

Cited by 319 (1 self)
 Add to MetaCart
channels. We develop a progressive texture classification algorithm which is not only computationally attractive but also has excellent performance. The performance of our new method is compared with that of several other methods using the DCT, DST, DHT, pyramidstructured wavelet transforms, Gabor filters
Computing Dominators and Dominance Frontiers
, 1994
"... this document is to describe and provide the code for an implementation of Lengauer and Tarjan's Algorithm for Finding Dominators in a Flowgraph [6]. We assume some amount of familiarity with the paper, but the purpose of this document is to expose some of the innerworkings of the algorithm wh ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
which are not readily apparent. We will also be implementing the algorithm described in Cytron et al. for calculating dominance frontiers [4]. This is a natural extension of Lengauer and Tarjan's algorithm which our optimizer passes will need to compute static single assignment (SSA) form
On the achievable diversitymultiplexing tradeoff in halfduplex cooperative channels
 IEEE TRANS. INFORM. THEORY
, 2005
"... We propose novel cooperative transmission protocols for delaylimited coherent fading channels consisting of (halfduplex and singleantenna) partners and one cell site. In our work, we differentiate between the relay, cooperative broadcast (downlink), and cooperative multipleaccess (CMA) (uplin ..."
Abstract

Cited by 311 (11 self)
 Add to MetaCart
link) channels. The proposed protocols are evaluated using Zheng–Tse diversity–multiplexing tradeoff. For the relay channel, we investigate two classes of cooperation schemes; namely, amplify and forward (AF) protocols and decode and forward (DF) protocols. For the first class, we establish an upper bound
A finitevolume, incompressible Navier–Stokes model for studies of the ocean on parallel computers.
 J. Geophys. Res.,
, 1997
"... Abstract. The numerical implementation of an ocean model based on the incompressible Navier Stokes equations which is designed for studies of the ocean circulation on horizontal scales less than the depth of the ocean right up to global scale is described. A "pressure correction" method i ..."
Abstract

Cited by 293 (32 self)
 Add to MetaCart
becomes very much larger than the vertical scale, the motion becomes more and more hydrostatic and the threedimensional Poisson operator becomes increasingly anisotropic and dominated by the vertical axis. Accordingly, a preconditioner is used which, in the hydrostatic limit, is an exact integral
Results 11  20
of
239,030