Sciweavers

355 search results - page 25 / 71
» A New Approximation Technique for Resource-Allocation Proble...
Sort
View
ATAL
2008
Springer
15 years 1 months ago
Adaptive Kanerva-based function approximation for multi-agent systems
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
Cheng Wu, Waleed Meleis
MOC
2002
92views more  MOC 2002»
14 years 11 months ago
Effects of uncertainties in the domain on the solution of Neumann boundary value problems in two spatial dimensions
An essential part of any boundary value problem is the domain on which the problem is defined. The domain is often given by scanning or another digital image technique with limited...
Ivo Babuska, Jan Chleboun
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
16 years 6 days ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani
PODS
1999
ACM
151views Database» more  PODS 1999»
15 years 4 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
16 years 1 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu