Sciweavers

1817 search results - page 343 / 364
» Extensive Games as Process Models
Sort
View
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 8 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
ICDE
2011
IEEE
237views Database» more  ICDE 2011»
13 years 2 months ago
Creating probabilistic databases from imprecise time-series data
— Although efficient processing of probabilistic databases is a well-established field, a wide range of applications are still unable to benefit from these techniques due to t...
Saket Sathe, Hoyoung Jeung, Karl Aberer
CLUSTER
2011
IEEE
12 years 10 months ago
Dynamic Load Balance for Optimized Message Logging in Fault Tolerant HPC Applications
—Computing systems will grow significantly larger in the near future to satisfy the needs of computational scientists in areas like climate modeling, biophysics and cosmology. S...
Esteban Meneses, Laxmikant V. Kalé, Greg Br...
DNA
2011
Springer
227views Bioinformatics» more  DNA 2011»
12 years 10 months ago
Cooperative Assembly Systems
Several molecular systems form large-scale objects. One would like to understand their assembly and how this assembly is regulated. As a first step, we investigate the phase trans...
Vincent Danos, Heinz Koeppl, John Wilson-Kanamori
SIGIR
2012
ACM
12 years 25 days ago
Time-based calibration of effectiveness measures
Many current effectiveness measures incorporate simplifying assumptions about user behavior. These assumptions prevent the measures from reflecting aspects of the search process...
Mark D. Smucker, Charles L. A. Clarke