Sciweavers

4047 search results - page 274 / 810
» The Discrete Basis Problem
Sort
View
TNN
2008
119views more  TNN 2008»
15 years 4 months ago
Selecting Useful Groups of Features in a Connectionist Framework
Abstract--Suppose for a given classification or function approximation (FA) problem data are collected using sensors. From the output of the th sensor, features are extracted, ther...
Debrup Chakraborty, Nikhil R. Pal
124
Voted
CGF
2005
133views more  CGF 2005»
15 years 4 months ago
Constrained Visualization Using the Shepard Interpolation Family
This paper discusses the problem of visualizing data where there are underlying constraints that must be preserved. For example, we may know that the data are inherently positive....
Ken W. Brodlie, Muhammed Rafiq Asim, Keith Unswort...
NPL
1998
175views more  NPL 1998»
15 years 4 months ago
Prediction of Chaotic Time-Series with a Resource-Allocating RBF Network
Abstract. One of the main problems associated with arti cial neural networks online learning methods is the estimation of model order. In this paper, we report about a new approach...
Roman Rosipal, Milos Koska, Igor Farkas
IJCAI
2003
15 years 6 months ago
A Planning Algorithm for Predictive State Representations
We address the problem of optimally controlling stochastic environments that are partially observable. The standard method for tackling such problems is to define and solve a Part...
Masoumeh T. Izadi, Doina Precup
TVCG
2008
167views more  TVCG 2008»
15 years 3 months ago
Optimal Surface Parameterization Using Inverse Curvature Map
Mesh parameterization is a fundamental technique in computer graphics. The major goals during mesh parameterization are to minimize both the angle distortion and the area distortio...
Yong-Liang Yang, Junho Kim, Feng Luo 0002, Shi-Min...