Sciweavers

6315 search results - page 249 / 1263
» Approximating Solution Structure
Sort
View
FM
2003
Springer
112views Formal Methods» more  FM 2003»
15 years 12 months ago
Structuring Retrenchments in B by Decomposition
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [1] as a liberalisation of classical refinement, for the formal description of application developments ...
Michael Poppleton, Richard Banach
RIDE
2002
IEEE
15 years 11 months ago
Enhancive Index for Structured Document
Structured documents, especially the XML documents, are made up of a few logical components, such as title, sections, subsections and paragraphs. The components in each structured...
Xiaoling Wang, Ji-Rong Wen, Yisheng Dong, Wenyin L...
ICPR
2004
IEEE
16 years 7 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
16 years 3 days ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
PPSN
2004
Springer
15 years 12 months ago
Spread of Vector Borne Diseases in a Population with Spatial Structure
Mathematical modeling of the spread of infectious diseases is a well established field with high practical importance. Underlying most analytical approaches is the assumption of ...
Dominique Chu, Jonathan E. Rowe