Sciweavers

179 search results - page 19 / 36
» On Approximating the Average Distance Between Points
Sort
View
INFORMS
1998
100views more  INFORMS 1998»
14 years 11 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
ESANN
2006
15 years 1 months ago
Data topology visualization for the Self-Organizing Map
The Self-Organizing map (SOM), a powerful method for data mining and cluster extraction, is very useful for processing data of high dimensionality and complexity. Visualization met...
Kadim Tasdemir, Erzsébet Merényi
VTC
2006
IEEE
158views Communications» more  VTC 2006»
15 years 5 months ago
An Adaptive-Scaling Algorithm for OFDM PAR Reduction Using Active Constellation Extension
Abstract— The Active Constellation Extension (ACE) technique is a lossless (in terms of throughput) Peak-to-Average Power Ratio (PAR) reduction technique that adaptively extends ...
Luqing Wang, Chintha Tellambura
VLDB
2008
ACM
147views Database» more  VLDB 2008»
15 years 12 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
82
Voted
ICIAR
2005
Springer
15 years 5 months ago
Shape Similarity Measurement for Boundary Based Features
In this study, we propose two algorithms for measuring the distance between shape boundaries. In the algorithms, shape boundary is represented by the Beam Angle Statistics (BAS), w...
Nafiz Arica, Fatos T. Yarman-Vural