Sciweavers

3825 search results - page 417 / 765
» More on pooling spaces
Sort
View
IDA
2002
Springer
15 years 6 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
AI
1998
Springer
15 years 6 months ago
Model-Based Average Reward Reinforcement Learning
Reinforcement Learning (RL) is the study of programs that improve their performance by receiving rewards and punishments from the environment. Most RL methods optimize the discoun...
Prasad Tadepalli, DoKyeong Ok
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 6 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
CORR
2010
Springer
58views Education» more  CORR 2010»
15 years 5 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali
ML
2008
ACM
110views Machine Learning» more  ML 2008»
15 years 5 months ago
A theory of learning with similarity functions
Kernel functions have become an extremely popular tool in machine learning, with an attractive theory as well. This theory views a kernel as implicitly mapping data points into a ...
Maria-Florina Balcan, Avrim Blum, Nathan Srebro