Sciweavers

630 search results - page 17 / 126
» Symbolic Domain Decomposition
Sort
View
SAS
1999
Springer
116views Formal Methods» more  SAS 1999»
14 years 21 days ago
Decomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
TSMC
2011
292views more  TSMC 2011»
13 years 3 months ago
Circular Blurred Shape Model for Multiclass Symbol Recognition
—In this paper, we propose a circular blurred shape model descriptor to deal with the problem of symbol detection and classification as a particular case of object recognition. ...
Sergio Escalera, Alicia Fornés, Oriol Pujol...
KR
2010
Springer
14 years 1 months ago
Decomposing Description Logic Ontologies
Recent years have seen the advent of large and complex ontologies, most notably in the medical domain. As a consequence, structuring mechanisms for ontologies are nowadays viewed ...
Boris Konev, Carsten Lutz, Denis Ponomaryov, Frank...
IRREGULAR
1998
Springer
14 years 20 days ago
Modeling Dynamic Load Balancing in Molecular Dynamics to Achieve Scalable Parallel Execution
To achieve scalable parallel performance in Molecular Dynamics Simulation, we have modeled and implemented several dynamic spatial domain decomposition algorithms. The modeling is ...
Lars S. Nyland, Jan Prins, Ru Huai Yun, Jan Herman...
AGILE
2009
Springer
343views GIS» more  AGILE 2009»
14 years 3 months ago
Line Decomposition Based on Critical Points Detection
The problem of line simplification is a recurrent problem in cartography. The purpose is to remove irrelevant details while emphasising the main features of the line. Most of the ...
Eric Guilbert