Sciweavers

3360 search results - page 180 / 672
» An Optimal Distributed Edge-Biconnectivity Algorithm
Sort
View
VLDB
1998
ACM
127views Database» more  VLDB 1998»
15 years 10 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...
CAV
2010
Springer
194views Hardware» more  CAV 2010»
15 years 10 months ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber
IPPS
2006
IEEE
16 years 17 days ago
An experimental study of optimizing bioinformatics applications
As bioinformatics is an emerging application of high performance computing, this paper first evaluates the memory performance of several representative bioinformatics application...
Guangming Tan, Lin Xu, Shengzhong Feng, Ninghui Su...
DSN
2009
IEEE
16 years 1 months ago
A QoS-aware fault tolerant middleware for dependable service composition
Based on the framework of service-oriented architecture (SOA), complex distributed systems can be dynamically and automatically composed by integrating distributed Web services pr...
Zibin Zheng, Michael R. Lyu
TIT
1998
90views more  TIT 1998»
15 years 6 months ago
Source Codes as Random Number Generators
—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asy...
Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio ...