Sciweavers

28 search results - page 4 / 6
» Computing f(A)b via Least Squares Polynomial Approximations
Sort
View
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
13 years 9 months ago
Approximating Representations for Large Numerical Databases
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Szymon Jaroszewicz, Marcin Korzen
ICML
2004
IEEE
14 years 8 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
TMI
2008
73views more  TMI 2008»
13 years 7 months ago
Tensor-Based Cortical Surface Morphometry via Weighted Spherical Harmonic Representation
Abstract--We present a new tensor-based morphometric framework that quantifies cortical shape variations using a local area element. The local area element is computed from the Rie...
Moo K. Chung, Kim M. Dalton, Richard J. Davidson
SAC
2008
ACM
13 years 7 months ago
Local linear regression with adaptive orthogonal fitting for the wind power application
For short-term forecasting of wind generation, a necessary step is to model the function for the conversion of meteorological variables (mainly wind speed) to power production. Su...
Pierre Pinson, Henrik Aalborg Nielsen, Henrik Mads...
JGO
2010
100views more  JGO 2010»
13 years 2 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti