Sciweavers

1387 search results - page 169 / 278
» Convexity in Discrete Space
Sort
View
COMPGEOM
1992
ACM
14 years 2 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar
PR
2006
87views more  PR 2006»
13 years 10 months ago
Prototype reduction schemes applicable for non-stationary data sets
All of the prototype reduction schemes (PRS) which have been reported in the literature, process time-invariant data to yield a subset of prototypes that are useful in nearest-nei...
Sang-Woon Kim, B. John Oommen
IDA
2002
Springer
13 years 9 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
CAD
2012
Springer
12 years 5 months ago
Flexible shape control for automatic resizing of apparel products
We provide a flexible shape control technique in this paper for the automatic resizing of apparel products. The automatic resizing function has become an essential part of the 3D...
Yuwei Meng, Charlie C. L. Wang, Xiaogang Jin
ICML
2006
IEEE
14 years 11 months ago
Iterative RELIEF for feature weighting
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
Yijun Sun, Jian Li