Sciweavers

1536 search results - page 265 / 308
» The Underlying Logic of Hoare Logic
Sort
View
MST
2006
129views more  MST 2006»
15 years 6 months ago
Reachability Problems on Regular Ground Tree Rewriting Graphs
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
Christof Löding
PAMI
2006
95views more  PAMI 2006»
15 years 6 months ago
Table Detection in Online Ink Notes
In documents, tables are important structured objects that present statistical and relational information. In this paper, we present a robust system which is capable of detecting t...
Zhouchen Lin, Junfeng He, Zhicheng Zhong, Rongrong...
CCE
2005
15 years 6 months ago
Logic-based outer approximation for globally optimal synthesis of process networks
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
María Lorena Bergamini, Pío A. Aguir...
TSMC
2008
136views more  TSMC 2008»
15 years 6 months ago
Learning Relational Descriptions of Differentially Expressed Gene Groups
Abstract-- This paper presents a method that uses gene ontologies, together with the paradigm of relational subgroup discovery, to find compactly described groups of genes differen...
Igor Trajkovski, Filip Zelezný, Nada Lavrac...
JAIR
2000
105views more  JAIR 2000»
15 years 5 months ago
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
Federico Barber