Results 1  10
of
1,744
A Fast and Elitist MultiObjective Genetic Algorithm: NSGAII
, 2000
"... Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) O(MN computational complexity (where M is the number of objectives and N is the population size), (ii) nonelitism approach, and (iii) the need for specifying a sharing param ..."
Abstract

Cited by 1815 (60 self)
 Add to MetaCart
Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) O(MN computational complexity (where M is the number of objectives and N is the population size), (ii) nonelitism approach, and (iii) the need for specifying a sharing
Markov chain monte carlo convergence diagnostics
 JASA
, 1996
"... A critical issue for users of Markov Chain Monte Carlo (MCMC) methods in applications is how to determine when it is safe to stop sampling and use the samples to estimate characteristics of the distribution of interest. Research into methods of computing theoretical convergence bounds holds promise ..."
Abstract

Cited by 371 (6 self)
 Add to MetaCart
review of thirteen convergence diagnostics, describing the theoretical basis and practical implementation of each. We then compare their performance in two simple models and conclude that all the methods can fail to detect the sorts of convergence failure they were designed to identify. We thus recommend
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
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
Data privacy through optimal kanonymization
 In ICDE
, 2005
"... Data deidentification reconciles the demand for release of data for research purposes and the demand for privacy from individuals. This paper proposes and evaluates an optimization algorithm for the powerful deidentification procedure known as kanonymization. A kanonymized dataset has the proper ..."
Abstract

Cited by 344 (3 self)
 Add to MetaCart
, and develop datamanagement strategies to reduce reliance on expensive operations such as sorting. Through experiments on real census data, we show the resulting algorithm can find optimal kanonymizations under two representative cost measures and a wide range of k. We also show that the algorithm can
SLIQ: A Fast Scalable Classifier for Data Mining
, 1996
"... . Classification is an important problem in the emerging field of data mining. Although classification has been studied extensively in the past, most of the classification algorithms are designed only for memoryresident data, thus limiting their suitability for data mining large data sets. This pap ..."
Abstract

Cited by 240 (9 self)
 Add to MetaCart
. This paper discusses issues in building a scalable classifier and presents the design of SLIQ 1 , a new classifier. SLIQ is a decision tree classifier that can handle both numeric and categorical attributes. It uses a novel presorting technique in the treegrowth phase. This sorting procedure
Maude: Specification and Programming in Rewriting Logic
, 2001
"... Maude is a highlevel language and a highperformance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules and ..."
Abstract

Cited by 217 (65 self)
 Add to MetaCart
and theories. The underlying equational logic chosen for Maude is membership equational logic, that has sorts, subsorts, operator overloading, and partiality definable by membership and equality conditions. Rewriting logic is reflective, in the sense of being able to express its own metalevel at the object
A Fast Voxel Traversal Algorithm for Ray Tracing
 In Eurographics ’87
, 1987
"... A fast and simple voxel traversal algorithm through a 3D space partition is introduced. Going from one voxel to its neighbour requires only two floating point comparisons and one floating point addition. Also, multiple ray intersections with objects that are in more than one voxel are eliminated. ..."
Abstract

Cited by 207 (5 self)
 Add to MetaCart
for this is that the heart of ray tracing, intersecting an object with a ray, is expensive and can easily take up to 95% of the rendering time. Unless some sort of intersection culling is performed, each ray must intersect all the objects in the scene, a very expensive proposition. There are two general strategies
merging, and sorting in parallel models of computation
 in “Proc. 14th Annual ACM Sympos. on Theory of Cornput
, 1982
"... A variety of models have been proposed for the study of synchronous parallel computation. These models are reviewed and some prototype problems are studied further. Two classes of models are recognized, fixed connection networks and models based on a shared memory. Routing and sorting are prototype ..."
Abstract

Cited by 109 (2 self)
 Add to MetaCart
A variety of models have been proposed for the study of synchronous parallel computation. These models are reviewed and some prototype problems are studied further. Two classes of models are recognized, fixed connection networks and models based on a shared memory. Routing and sorting are prototype
Bottomup computation of sparse and Iceberg CUBE
 In Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP, DOLAP ’02
, 1999
"... We introduce the IcebergCUBE problem as a reformulation of the datacube (CUBE) problem. The IcebergCUBE problem is to compute only those groupby partitions with an aggregate value (e.g., count) above some minimum support threshold. The result of IcebergCUBE can be used (1) to answer groupby que ..."
Abstract

Cited by 187 (4 self)
 Add to MetaCart
pruning strategy when computing sparse, complete CUBES. We present a thorough performance evaluation over a broad range of workloads. Our evaluation demonstrates that (in contrast to earlier assumptions) minimizing the aggregations or the number of sorts is not the most important aspect of the sparse CUBE
Synaptojanin 1 Is Required for Endolysosomal Trafficking of Synaptic Proteins in Cone Photoreceptor Inner Segments
, 2013
"... Highly polarized cells such as photoreceptors require precise and efficient strategies for establishing and maintaining the proper subcellular distribution of proteins. The signals and molecular machinery that regulate trafficking and sorting of synaptic proteins within cone inner segments is mostly ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Highly polarized cells such as photoreceptors require precise and efficient strategies for establishing and maintaining the proper subcellular distribution of proteins. The signals and molecular machinery that regulate trafficking and sorting of synaptic proteins within cone inner segments
Results 1  10
of
1,744