Sciweavers

3250 search results - page 608 / 650
» Parameterized Learning Complexity
Sort
View
135
Voted
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
15 years 3 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
124
Voted
NIPS
1998
15 years 3 months ago
Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
Michael J. Kearns, Satinder P. Singh
JISBD
2000
15 years 3 months ago
Databases and Natural Language Interfaces
A Natural Language Interface for Databases allows users of multimedia kiosks to formulate natural language questions. User questions are first translated into a logic language and ...
Porfírio P. Filipe, Nuno J. Mamede
117
Voted
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 3 months ago
Evolutionary swarm design of architectural idea models
In this paper we present a swarm grammar system that makes use of bio-inspired mechanisms of reproduction, communication and construction in order to build three-dimensional struc...
Sebastian von Mammen, Christian Jacob
149
Voted
GG
2008
Springer
15 years 3 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell