Sciweavers

84 search results - page 8 / 17
» On the Number of Pseudo-Triangulations of Certain Point Sets
Sort
View
CORR
2010
Springer
148views Education» more  CORR 2010»
13 years 8 months ago
Perturbation Resilience and Superiorization of Iterative Algorithms
Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there...
Yair Censor, R. Davidi, Gabor T. Herman
ICML
2005
IEEE
14 years 9 months ago
Robust one-class clustering using hybrid global and local search
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
Gunjan Gupta, Joydeep Ghosh
SDM
2008
SIAM
165views Data Mining» more  SDM 2008»
13 years 10 months ago
On the Dangers of Cross-Validation. An Experimental Evaluation
Cross validation allows models to be tested using the full training set by means of repeated resampling; thus, maximizing the total number of points used for testing and potential...
R. Bharat Rao, Glenn Fung
FSS
2008
94views more  FSS 2008»
13 years 8 months ago
Lattices of convex normal functions
The algebra of truth values of type-2 fuzzy sets is the set of all functions from the unit interval into itself, with operations de ned in terms of certain convolutions of these f...
John Harding, Carol L. Walker, Elbert A. Walker
CAD
2006
Springer
13 years 8 months ago
A sweepline algorithm for Euclidean Voronoi diagram of circles
Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative...
Li Jin, Donguk Kim, Lisen Mu, Deok-Soo Kim, Shi-Mi...