Sciweavers

3255 search results - page 530 / 651
» Combination of Abstractions in the ASTR
Sort
View
ITA
2007
13 years 10 months ago
Three notes on the complexity of model checking fixpoint logic with chop
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
Martin Lange
JCC
2007
70views more  JCC 2007»
13 years 10 months ago
Self-organizing superimposition algorithm for conformational sampling
Abstract: A novel self-organizing algorithm for conformational sampling is introduced, in which precomputed conformations of rigid fragments are used as templates to enforce the de...
Fangqiang Zhu, Dimitris K. Agrafiotis
JODS
2007
142views Data Mining» more  JODS 2007»
13 years 10 months ago
Context Dependency Management in Ontology Engineering: A Formal Approach
Abstract. A viable ontology engineering methodology requires supporting domain experts in gradually building and managing increasingly complex versions of ontological elements and ...
Pieter De Leenheer, Aldo de Moor, Robert Meersman
TSP
2008
115views more  TSP 2008»
13 years 10 months ago
The Shiftable Complex Directional Pyramid - Part I: Theoretical Aspects
Abstract--This paper presents an over-complete multiscale decomposition by combining the Laplacian pyramid and the complex directional filter bank (DFB). The filter bank is constru...
Truong T. Nguyen, Soontorn Oraintara
ALGORITHMICA
2004
112views more  ALGORITHMICA 2004»
13 years 10 months ago
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...