Sciweavers

5169 search results - page 176 / 1034
» Locality approximation using time
Sort
View
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
15 years 6 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
ESANN
2003
15 years 6 months ago
Approximation of Function by Adaptively Growing Radial Basis Function Neural Networks
In this paper a neural network for approximating function is described. The activation functions of the hidden nodes are the Radial Basis Functions (RBF) whose parameters are learn...
Jianyu Li, Siwei Luo, Yingjian Qi
TSMC
2008
140views more  TSMC 2008»
15 years 5 months ago
Adaptive Feedback Control by Constrained Approximate Dynamic Programming
A constrained approximate dynamic programming (ADP) approach is presented for designing adaptive neural network (NN) controllers with closed-loop stability and performance guarante...
S. Ferrari, J. E. Steck, R. Chandramohan
EDBT
2009
ACM
160views Database» more  EDBT 2009»
15 years 9 months ago
Estimating aggregates in time-constrained approximate queries in Oracle
The concept of time-constrained SQL queries was introduced to address the problem of long-running SQL queries. A key approach adopted for supporting time-constrained SQL queries i...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
CVPR
2004
IEEE
16 years 7 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...