Sciweavers

1451 search results - page 143 / 291
» Case Studies in Model Manipulation for Scientific Computing
Sort
View
SSD
1999
Springer
116views Database» more  SSD 1999»
15 years 9 months ago
Generalizing Graphs Using Amalgamation and Selection
This work is a contribution to the developing literature on multi-resolution data models. It considers operations for model-oriented generalization in the case where the underlying...
John G. Stell, Michael F. Worboys
ICPR
2008
IEEE
15 years 11 months ago
Utilizing non-uniform cost learning for active control of inter-class confusion
In this paper, we demonstrate the use of learning with non-uniform error-cost as a novel technique to design a multiclass cost-sensitive classifier. We investigate two important ...
Dwi Sianto Mansjur, Qiang Fu, Biing-Hwang Juang
ASM
2010
ASM
15 years 8 months ago
Refinement-Animation for Event-B - Towards a Method of Validation
We provide a detailed description of refinement in Event-B, both as a contribution in itself and as a foundation for the approach to simultaneous animation of multiple levels of re...
Stefan Hallerstede, Michael Leuschel, Daniel Plagg...
SRDS
1998
IEEE
15 years 9 months ago
Practical Parallel Algorithms for Minimum Spanning Trees
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
Frank K. H. A. Dehne, Silvia Götz
BIRTHDAY
1997
Springer
15 years 8 months ago
Syntax vs. Semantics on Finite Structures
Abstract. Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a rst-order sentence is preserved b...
Natasha Alechina, Yuri Gurevich