Sciweavers

948 search results - page 183 / 190
» What can we achieve by arbitrary announcements
Sort
View
FQAS
2006
Springer
101views Database» more  FQAS 2006»
13 years 11 months ago
Cooperative Discovery of Interesting Action Rules
Action rules introduced in [12] and extended further to e-action rules [21] have been investigated in [22], [13], [20]. They assume that attributes in a database are divided into t...
Agnieszka Dardzinska, Zbigniew W. Ras
JCC
2007
121views more  JCC 2007»
13 years 7 months ago
Speeding up parallel GROMACS on high-latency networks
: We investigate the parallel scaling of the GROMACS molecular dynamics code on Ethernet Beowulf clusters and what prerequisites are necessary for decent scaling even on such clust...
Carsten Kutzner, David van der Spoel, Martin Fechn...
CGO
2011
IEEE
12 years 11 months ago
Dynamically accelerating client-side web applications through decoupled execution
— The emergence and wide adoption of web applications have moved the client-side component, often written in JavaScript, to the forefront of computing on the web. Web application...
Mojtaba Mehrara, Scott A. Mahlke
JMLR
2008
129views more  JMLR 2008»
13 years 7 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
ML
2010
ACM
142views Machine Learning» more  ML 2010»
13 years 5 months ago
Fast adaptive algorithms for abrupt change detection
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
Daniel Nikovski, Ankur Jain