Sciweavers

1082 search results - page 74 / 217
» Approximation Algorithms for Spreading Points
Sort
View
IJCNN
2006
IEEE
14 years 1 months ago
Information Theoretic Angle-Based Spectral Clustering: A Theoretical Analysis and an Algorithm
— Recent work has revealed a close connection between certain information theoretic divergence measures and properties of Mercer kernel feature spaces. Specifically, it has been...
Robert Jenssen, Deniz Erdogmus, Jose C. Principe
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
13 years 8 months ago
Accelerating convergence using rough sets theory for multi-objective optimization problems
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
Luis V. Santana-Quintero, Carlos A. Coello Coello
WSC
2004
13 years 9 months ago
Experimental Performance Evaluation of Histogram Approximation for Simulation Output Analysis
We summarize the results of an experimental performance evaluation of using an empirical histogram to approximate the steady-state distribution of the underlying stochastic proces...
E. Jack Chen, W. David Kelton
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
14 years 29 days ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
EDBT
2006
ACM
182views Database» more  EDBT 2006»
14 years 7 months ago
On High Dimensional Skylines
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth...