1227 search results - page 88 / 246 » Approximate Kernel Clustering |
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
KBSE
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper describes the application of advanced formal modelling techniques and tools from the CADP toolset to the verification of CFS, a distributed file system kernel. After a ...
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
191
click to vote
ICDE
2001
IEEE
15 years 11 months ago
2001
IEEE
We investigate query routing techniques in a cluster of databases for a query-dominant environment. The objective is to decrease query response time. Each component of the cluster...