Sciweavers

3171 search results - page 311 / 635
» Application of Reduce Order Modeling to Time Parallelization
Sort
View
SIGMOD
2006
ACM
145views Database» more  SIGMOD 2006»
16 years 4 months ago
Automatic client-server partitioning of data-driven web applications
Current application development tools provide completely different programming models for the application server (e.g., Java and J2EE) and the client web browser (e.g., JavaScript...
Nicholas Gerner, Fan Yang 0002, Alan J. Demers, Jo...
AAI
2007
132views more  AAI 2007»
15 years 4 months ago
Incremental Extraction of Association Rules in Applicative Domains
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
Arianna Gallo, Roberto Esposito, Rosa Meo, Marco B...
PPOPP
2011
ACM
14 years 7 months ago
GRace: a low-overhead mechanism for detecting data races in GPU programs
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
Mai Zheng, Vignesh T. Ravi, Feng Qin, Gagan Agrawa...
IPPS
2000
IEEE
15 years 9 months ago
A Mechanism for Speculative Memory Accesses Following Synchronizing Operations
In order to reduce the overhead of synchronizing operations of shared memory multiprocessors, this paper proposes a mechanism, named specMEM, to execute memory accesses following ...
Takayuki Sato, Kazuhiko Ohno, Hiroshi Nakashima
IJCAI
2003
15 years 6 months ago
Formal Verification of Diagnosability via Symbolic Model Checking
This paper addresses the formal verification of diagnosis systems. We tackle the problem of diagnosability: given a partially observable dynamic system, and a diagnosis system obs...
Alessandro Cimatti, Charles Pecheur, Roberto Cavad...