Results 1  10
of
8,626
Derived Particles Requires Minimal Amounts of
, 2000
"... This article cites 53 articles, 41 of which can be accessed free ..."
Sequential minimal optimization: A fast algorithm for training support vector machines
 Advances in Kernel MethodsSupport Vector Learning
, 1999
"... This paper proposes a new algorithm for training support vector machines: Sequential Minimal Optimization, or SMO. Training a support vector machine requires the solution of a very large quadratic programming (QP) optimization problem. SMO breaks this large QP problem into a series of smallest possi ..."
Abstract

Cited by 461 (3 self)
 Add to MetaCart
This paper proposes a new algorithm for training support vector machines: Sequential Minimal Optimization, or SMO. Training a support vector machine requires the solution of a very large quadratic programming (QP) optimization problem. SMO breaks this large QP problem into a series of smallest
The Xtree: An index structure for highdimensional data
 In Proceedings of the Int’l Conference on Very Large Data Bases
, 1996
"... In this paper, we propose a new method for indexing large amounts of point and spatial data in highdimensional space. An analysis shows that index structures such as the R*tree are not adequate for indexing highdimensional data sets. The major problem of Rtreebased index structures is the over ..."
Abstract

Cited by 592 (17 self)
 Add to MetaCart
In this paper, we propose a new method for indexing large amounts of point and spatial data in highdimensional space. An analysis shows that index structures such as the R*tree are not adequate for indexing highdimensional data sets. The major problem of Rtreebased index structures
Nonlinear total variation based noise removal algorithms
, 1992
"... A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using the g ..."
Abstract

Cited by 2271 (51 self)
 Add to MetaCart
A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using
The Cache Performance and Optimizations of Blocked Algorithms
 In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems
, 1991
"... Blocking is a wellknown optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on entire rows or columns of an array, blocked algorithms operate on submatrices or blocks, so that data loaded into the faster levels of the memory hierarchy are reused. This ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
. This paper presents cache performance data for blocked programs and evaluates several optimizations to improve this performance. The data is obtained by a theoretical model of data conflicts in the cache, which has been validated by large amounts of simulation. We show that the degree of cache interference
Energy Conserving Routing in Wireless Adhoc Networks
, 2000
"... An adhoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
the set of possible one hop away neighbors. Traffic forwarding through multiple hops is employed when the intended destination is not within immediate reach. The nodes have limited initial amounts of energy that is consumed in different rates depending on the power level and the intended receiver. We
How to assess large groups with the minimal amount of resources but preserving quality
"... Assessment in education is basically a process by which a student can be measured and, properly used, is a valuable and essential part of any educational system. There are many types of assessments that can be used and the following three types of assessment will be explored in this paper, namely (a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Assessment in education is basically a process by which a student can be measured and, properly used, is a valuable and essential part of any educational system. There are many types of assessments that can be used and the following three types of assessment will be explored in this paper, namely (a) multichoice, (b) group work and (c) presentations. The list is by no means exhaustive but these have been used and tested by the author with large groups to ascertain statistical understanding. The relative advantages and drawbacks are to be elucidated. Assessment of the three types, listed above, that are to be examined in this paper have been used for some considerable time in educational institutions. Their usefulness in large group situations is the main emphasis here although points and issues raised may also be poignant to smaller groups 1.
Compositionality in the Synchronization of Processors exchanging a minimal amount of information
"... nly and sendonly neighbours in order to guarantee a unidirectional flow of information (for circular arrays of processors see [4]). In both cases, the goal was to obtain a synchronization of all the processors at a given time. In literature such results are often referred to as nonminimal time solu ..."
Abstract
 Add to MetaCart
solutions. Besides the intrinsic interest for this theoretical problem, the study of nonminimal time solutions concerns also the design of a cellular automaton computing composition of functions, see [8]. The model. We consider a one bit 2dimensional cellular automaton. It is an array of (m \Theta n
A metric for distributions with applications to image databases
, 1998
"... We introduce a new distance between two distributions that we call the Earth Mover’s Distance (EMD), which reflects the minimal amount of work that must be performed to transform one distributioninto the other by moving “distribution mass ” around. This is a special case of the transportation proble ..."
Abstract

Cited by 438 (6 self)
 Add to MetaCart
We introduce a new distance between two distributions that we call the Earth Mover’s Distance (EMD), which reflects the minimal amount of work that must be performed to transform one distributioninto the other by moving “distribution mass ” around. This is a special case of the transportation
A Modified Method for Whole Exome Resequencing from Minimal Amounts of Starting DNA
, 2011
"... Next generation DNA sequencing (NGS) technologies have revolutionized the pace at which whole genome and exome sequences can be generated. However, despite these advances, many of the methods for targeted resequencing, such as the generation of highdepth exome sequences, are somewhat limited by the ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
and resequencing using as little as 50 ng of starting DNA. The sequencing libraries generated by this minimal starting amount (MSACap) method generate datasets that are comparable to standard amount (SA) whole exome libraries that use three micrograms of starting DNA. This method, which can be performed in most
Results 1  10
of
8,626