Sciweavers

2600 search results - page 33 / 520
» Clustering with or without the Approximation
Sort
View
ICPPW
2003
IEEE
14 years 1 months ago
Performance Analysis of Approximate String Searching Implementations for Heterogeneous Computing Platform
This paper presents an analytical performance prediction model that can be used to predict the speedup and similar performance metrics of four approximate string searching implemen...
Panagiotis D. Michailidis, Konstantinos G. Margari...
ICCBR
2007
Springer
14 years 1 months ago
An Analysis of Case-Based Value Function Approximation by Approximating State Transition Graphs
We identify two fundamental points of utilizing CBR for an adaptive agent that tries to learn on the basis of trial and error without a model of its environment. The first link co...
Thomas Gabel, Martin Riedmiller
CINQ
2004
Springer
116views Database» more  CINQ 2004»
13 years 11 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
ICC
2007
IEEE
142views Communications» more  ICC 2007»
14 years 2 months ago
Reduced-Complexity Cluster Modelling for the 3GPP Channel Model
—The realistic performance of a multi-input multi-output (MIMO) communication system depends strongly on the spatial correlation properties introduced by clustering in the propag...
Hui Xiao, Alister G. Burr, Rodrigo C. de Lamare
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
14 years 8 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li