Pruning of structural synapses occurs with development and learning. A deficit in pruning of cortical excitatory synapses and the resulting hyperconnectivity is hypothesized to underlie the etiology of fragile X syndrome (FXS) and related autistic disorders. However, clear evidence for pruning in neocortex and its impairment in FXS remains elusive. Using simultaneous recordings of pyramidal neu...

We consider pruning steps used in a branch-and-bound algorithm for veri ed global optimization. A rst-order pruning step was given by Ratz using automatic computation of a rst-order slope tuple [21, 22]. In this paper, we introduce a second-order pruning step which is based on automatic computation of a second-order slope tuple. We add this second-order pruning step to the algorithm of Ratz. Fu...

Two pruning algorithms for the Vector-Radix Fast Cosine Transform are presented. Both are based on an in-place approach of the direct two-dimensional fast cosine transform (2D FCT). The first pruning algorithm concerns the computation of N0xN0 out of NxN DCT points, where both N0 and N are powers of 2. The second pruning algorithm is more general and concerns a recursive approach for the comput...

Pruning provides an important tool for control of nondeterminism in Prolog systems. Current Tabled Prolog systems improve Prolog’s evaluation strategy in several ways, but lack satisfactory support for pruning operations. In this paper we present an extension to the evaluation mechanism of Tabled Prolog to support pruning. This extension builds on the concept of demand to select tables to prune...

How much can pruning algorithms teach us about the fundamentals of learning representations in neural networks? And how much can these fundamentals help while devising new pruning techniques? A lot, it turns out. Neural network pruning has become a topic of great interest in recent years, and many different techniques have been proposed to address this problem. The decision of what to prune and...

Post pruning of decision trees has been a successful approach in many real-world experiments, but over all possible concepts it does not bring any inherent improvement to an algorithm's performance. This work explores how a PAC-proven decision tree learning algorithm fares in comparison with two variants of the normal top-down induction of decision trees. The algorithm does not prune its hypoth...

This paper investigates an approach to the permutation flowshop scheduling problem based on Tabu Search with an additional memory structure called a ‘pruning pattern list’. The pruning pattern list approach allows a better use of the critical block information. A solution of the flowshop scheduling problem is represented by a permutation of job numbers. A pruning pattern is generated from a sol...

Nearest neighbor queries on R-trees use a number of pruning techniques to improve the search. We examine three common 1-nearest neighbor pruning strategies and generalize them to k-nearest neighbors. This generalization clears up a number of prior misconceptions. Specifically, we show that the generalization of one pruning technique, referred to as strategy 2, is non-trivial and requires the in...

Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is generally used as the cost criterion for broadcasting. The problem of finding the minimum number of forward nodes is NPcomplete. Among various approximation approaches, dominant pruning [7] utilizes 2-hop neighborhood in...

Anecdotal evidence gathered from pruning crew observations indicates that there may be enhanced branch growth at the new crown base in young pruned coastal Douglas-fir (Pseudotsuga menziesii var. menziesii) trees compared to unpruned trees. This has the potential to reduce the quality and value of the stem above the pruned portion of the bole. An analysis of the size of branches in the remainin...