Sciweavers

1382 search results - page 143 / 277
» Formal Analysis of Online Algorithms
Sort
View
PODS
2008
ACM
159views Database» more  PODS 2008»
16 years 6 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 12 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
ECAI
2008
Springer
15 years 8 months ago
A probabilistic analysis of diagnosability in discrete event systems
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
Farid Nouioua, Philippe Dague
KDD
2003
ACM
243views Data Mining» more  KDD 2003»
16 years 6 months ago
Accurate decision trees for mining high-speed data streams
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
João Gama, Pedro Medas, Ricardo Rocha
ISCAS
2005
IEEE
214views Hardware» more  ISCAS 2005»
16 years 2 hour ago
Blind separation of statistically independent signals with mixed sub-Gaussian and super-Gaussian probability distributions
— In the context of Independent Component Analysis (ICA), we propose a simple method for online estimation of activation functions in order to blindly separate instantaneous mixt...
Muhammad Tufail, Masahide Abe, Masayuki Kawamata