Sciweavers

3941 search results - page 74 / 789
» Computational Efficiency of Batching Methods
Sort
View
CAISE
2005
Springer
14 years 2 months ago
Computing the Relevant Instances That May Violate an OCL Constraint
Integrity checking is aimed at efficiently determining whether the state of the information base is consistent after the application of a set of structural events. One possible way...
Jordi Cabot, Ernest Teniente
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
13 years 3 months ago
Hybrid moment computation algorithm for biochemical reaction networks
Moment computation is essential to the analysis of stochastic kinetic models of biochemical reaction networks. It is often the case that the moment evolution, usually the first and...
Yun-Bo Zhao, Jongrae Kim, João Pedro Hespan...
DCC
2005
IEEE
14 years 8 months ago
Efficient String Matching Algorithms for Combinatorial Universal Denoising
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthuk...
MVA
1994
13 years 10 months ago
Robust Line Drawing Understanding Incorporating Efficient Closed Symbols Extraction
This paper presents an efficient extraction method of closed loops as primitive symbols of line drawings, and an robust line drawing understanding system incorporating this extrac...
Shin'ichi Satoh, Hiroshi Mo, Masao Sakauchi
COMPUTING
2008
87views more  COMPUTING 2008»
13 years 9 months ago
Simple a posteriori error estimators for the h-version of the boundary element method
The h-h/2-strategy is one very basic and well-known technique for the a posteriori error estimation for Galerkin discretizations of energy minimization problems. Let denote the e...
Samuel Ferraz-Leite, Dirk Praetorius