The most common retrieval systems run queries independently of one another — no data about the queries is retained from query to query. This paper describes an unsupervised learning algorithm that uses information about previous queries to prune new query results. The algorithm has two distinct phases. The first trains on a batch of queries; in doing so, it learns about the collection and the r...

Many researchers have proposed pruning algorithms in numerous ways to optimize the network architecture (Castellano et al., 1997; Ahmmed et al., 2007; Henrique et al., 2000; Ponnapalli et al., 1999). Reed (1993) and Engelbrecht (2001) have given detailed surveys of pruning algorithms. Each algorithm has its own advantages and limitations. Some algorithms (Engelbrecht, 2001; Xing & Hu, 2009) pru...

Traditional rejection/reduction tests used in branch-and-prune methods for nonlinear systems usually are based on various forms of the interval Newton operator and constraint propagation techniques. Hence, they are relatively costly. This paper considers an additional phase of a branchand-prune method for the exclusion of regions not containing any solutions. Low-discrepancy sequences of Sobol ...

In this work, we focus on the problem of image instance retrieval with deep descriptors extracted from pruned Convolutional Neural Networks (CNN). The objective is to heavily prune convolutional edges while maintaining retrieval performance. To this end, we introduce both data-independent and data-dependent heuristics to prune convolutional edges, and evaluate their performance across various c...

In distributed information retrieval, answers from separate collections are combined into a single result set. However, the collections may overlap. The fact that the collections are distributed means that it is not in general feasible to prune duplicate and near-duplicate documents at index time. In this paper we introduce and analyze the grainy hash vector, a compact document representation t...

Boosting is used to determine the order in which classifiers are aggregated in a bagging ensemble. Early stopping in the aggregation of the classifiers in the ordered bagging ensemble allows the identification of subensembles that require less memory for storage, have a faster classification speed and can perform better than the original bagging ensemble. Furthermore, ensemble pruning does not ...

We report a term, small for gestational age neonate having full spectrum of VACTERL association. In addition, the neonate also had triad of signs and symptoms associated with prune belly syndrome. The concurrence of these two syndromes could lie in their common etiology of defect in mesodermal differentiation. Such a combination is extremely rare and is generally incompatible with life.

Prune Belly syndrome (PBS) is a rare congenital anomaly and is almost exclusive to males. We are reporting 2 cases of PBS. The first case of 8 days old baby born to a mother (29 years) who has history of such child previously but unfortunately that baby didn’t survive and died at 1.5 years of age. On physical examination child had wrinkled skin over abdomen showing signs of deficient abdominal ...

Recent development of three-dimensional (3D) and four-dimensional ultrasound (4D), specially using tomographic ultrasound image (TUI), inverse mode, automatic volume calculation (AVC) and virtual organ computer-aided analysis (VOCAL), provided us with new possibilities to study fetal low urinary obstructions before 24th week. Ultrasound scan studies have been conducted in order to provide infor...