Results 1 - 10 of 945

A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood

by Stéphane Guindon, Olivier Gascuel , 2003
"... The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements. The ..."
Abstract - Cited by 2182 (27 self) - Add to MetaCart
. The core of this method is a simple hill-climbing algorithm that adjusts tree topology and branch lengths simultaneously. This algorithm starts from an initial tree built by a fast distance-based method and modifies this tree to improve its likelihood at each iteration. Due to this simultaneous adjustment

Simple statistical gradient-following algorithms for connectionist reinforcement learning

by Ronald J. Williams - Machine Learning , 1992
"... Abstract. This article presents a general class of associative reinforcement learning algorithms for connectionist networks containing stochastic units. These algorithms, called REINFORCE algorithms, are shown to make weight adjustments in a direction that lies along the gradient of expected reinfor ..."
Abstract - Cited by 449 (0 self) - Add to MetaCart
Abstract. This article presents a general class of associative reinforcement learning algorithms for connectionist networks containing stochastic units. These algorithms, called REINFORCE algorithms, are shown to make weight adjustments in a direction that lies along the gradient of expected

Local Learning Algorithms

by Eon Bottou, Vladimir Vapnik - Neural Computation , 1992
"... Very rarely are training data evenly distributed in the input space. Local learning algorithms attempt to locally adjust the capacity of the training system to the properties of the training set in each area of the input space. The family of local learning algorithms contains known methods, like the ..."
Abstract - Cited by 158 (1 self) - Add to MetaCart
Very rarely are training data evenly distributed in the input space. Local learning algorithms attempt to locally adjust the capacity of the training system to the properties of the training set in each area of the input space. The family of local learning algorithms contains known methods, like

Using Genetic Algorithms for Concept Learning

by Kenneth A. De Jong, William M. Spears, Diana F. Gordon
"... In this paper, we explore the use of genetic algorithms (GAs) as a key element in the design and implementation of robust concept learning systems. We describe and evaluate a GA-based system called GABIL that continually learns and refines concept classification rules from its interaction with the e ..."
Abstract - Cited by 165 (5 self) - Add to MetaCart
In this paper, we explore the use of genetic algorithms (GAs) as a key element in the design and implementation of robust concept learning systems. We describe and evaluate a GA-based system called GABIL that continually learns and refines concept classification rules from its interaction

Mitigating unfairness due to physical layer capture in practical 802.11 mesh networks

by Wei Wang, Ben Leong, Wei Tsang Ooi - IEEE Transactions on Mobile Computing
"... Abstract—In this paper, we describe FairMesh, which is the first attempt at mitigating the unfairness arising from physical layer capture (PLC) in 802.11 mesh networks. In the presence of PLC, which is surprisingly common in practical mesh networks, existing state-of-art solutions either fail to cor ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
to correctly identify the sender that needs to be throttled or are too aggressive in reducing the sending rate. FairMesh is able to accurately detect unfairness quickly and employs a simple CWmin adjustment algorithm to achieve approximate max-min fairness. Our key insight is that the nodes that cause

Interactive Local Adjustment of Tonal Values

by Dani Lischinski, Zeev Farbman, Matt Uyttendaele, Richard Szeliski
"... This paper presents a new interactive tool for making local adjustments of tonal values and other visual parameters in an image. Rather than carefully selecting regions or hand-painting layer masks, the user quickly indicates regions of interest by drawing a few simple brush strokes and then uses ..."
Abstract - Cited by 97 (11 self) - Add to MetaCart
This paper presents a new interactive tool for making local adjustments of tonal values and other visual parameters in an image. Rather than carefully selecting regions or hand-painting layer masks, the user quickly indicates regions of interest by drawing a few simple brush strokes and then uses

Centroid-Based Document Classification: Analysis & Experimental Results

by Eui-Hong (Sam) Han, George Karypis , 2000
"... In this paper we present a simple linear-time centroid-based document classification algorithm, that despite its simplicity and robust performance, has not been extensively studied and analyzed. Our experiments show that this centroid-based classifier consistently and substantially outperforms o ..."
Abstract - Cited by 138 (1 self) - Add to MetaCart
In this paper we present a simple linear-time centroid-based document classification algorithm, that despite its simplicity and robust performance, has not been extensively studied and analyzed. Our experiments show that this centroid-based classifier consistently and substantially outperforms

A Simple Rate Control Algorithm for Maximizing Total User Utility

by Koushik Kar, Saswati Sarkar, Leandros Tassiulas , 2001
"... In this paper, we consider the rate control problem with the objective of maximizing the total user utility. It takes into account the possible differences in user requirements, and also provides a framework for achieving a wide range of fairness objectives. We propose a simple algorithm for achievi ..."
Abstract - Cited by 63 (9 self) - Add to MetaCart
In this paper, we consider the rate control problem with the objective of maximizing the total user utility. It takes into account the possible differences in user requirements, and also provides a framework for achieving a wide range of fairness objectives. We propose a simple algorithm

Graph layout adjustment strategies

by Margaret-Anne D. Storey, Hausi A. Müller - IN PROCEEDINGS OF GRAPH DRAWING , 1995
"... When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightness of lines, graph topology, orthogonalities and proximities. A layout adjustment algorithm which can be used tocreate sheye vie ..."
Abstract - Cited by 39 (6 self) - Add to MetaCart
When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightness of lines, graph topology, orthogonalities and proximities. A layout adjustment algorithm which can be used tocreate sheye

Comparison of a simple algorithm with carbohydrate counting for adjustment of mealtime insulin glulisine

by Richard M. Bergenstal
"... OBJECTIVE — Carbohydrate counting is an effective approach to mealtime insulin adjustment in type 1 diabetes but has not been rigorously assessed in type 2 diabetes. We sought to compare an insulin-to-carbohydrate ratio with a simple algorithm for adjusting the dose of prandial insulin glusiline. RE ..."
Abstract - Add to MetaCart
OBJECTIVE — Carbohydrate counting is an effective approach to mealtime insulin adjustment in type 1 diabetes but has not been rigorously assessed in type 2 diabetes. We sought to compare an insulin-to-carbohydrate ratio with a simple algorithm for adjusting the dose of prandial insulin glusiline
Results 1 - 10 of 945