Sciweavers

193 search results - page 24 / 39
» Decidable logics combining heap structures and data
Sort
View
PKDD
2005
Springer
125views Data Mining» more  PKDD 2005»
14 years 1 months ago
A Propositional Approach to Textual Case Indexing
Abstract. Problem solving with experiences that are recorded in text form requires a mapping from text to structured cases, so that case comparison can provide informed feedback fo...
Nirmalie Wiratunga, Robert Lothian, Sutanu Chakrab...
POPL
1993
ACM
13 years 11 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
DAS
2010
Springer
13 years 5 months ago
Information extraction by finding repeated structure
Repetition of layout structure is prevalent in document images. In document design, such repetition conveys the underlying logical and functional structure of the data. For exampl...
Evgeniy Bart, Prateek Sarkar
LICS
2009
IEEE
14 years 2 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
MICCAI
2008
Springer
14 years 8 months ago
A Hybrid System for the Semantic Annotation of Sulco-Gyral Anatomy in MRI Images
This paper presents an interactive system for the annotation of brain anatomical structures in Magnetic Resonance Images. The system is based on hybrid knowledge and techniques. Fi...
Ammar Mechouche, Xavier Morandi, Christine Golbr...