Sciweavers

16430 search results - page 675 / 3286
» On Computable Tree Functions
Sort
View
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
16 years 1 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
KDD
2003
ACM
130views Data Mining» more  KDD 2003»
16 years 7 months ago
Towards systematic design of distance functions for data mining applications
Distance function computation is a key subtask in many data mining algorithms and applications. The most effective form of the distance function can only be expressed in the conte...
Charu C. Aggarwal
CGF
2006
120views more  CGF 2006»
15 years 7 months ago
Enhancing the Interactive Visualization of Procedurally Encoded Multifield Data with Ellipsoidal Basis Functions
Functional approximation of scattered data is a popular technique for compactly representing various types of datasets in computer graphics, including surface, volume, and vector ...
Yun Jang, Ralf P. Botchen, Andreas Lauser, David S...
ICC
2009
IEEE
114views Communications» more  ICC 2009»
16 years 2 months ago
Markov Chain Minimum Bit Error Rate Detection for Multi-Functional MIMO Uplink
— In this paper, we introduce a novel Markov Chain (MC) representation aided Minimum Bit Error Rate (MBER) detection method that is applicable to an M-QAM modulated SDM/SDMA upli...
Shinya Sugiura, Sheng Chen, Lajos Hanzo
ICDAR
2007
IEEE
16 years 1 months ago
Representing and Characterizing Handwritten Mathematical Symbols through Succinct Functional Approximation
We model on-line ink traces for a set of 219 symbols to “best fit” low-degree polynomial series. Using a collection of mathematical writing samples, we find that in many cas...
Bruce W. Char, Stephen M. Watt