Sciweavers

3396 search results - page 545 / 680
» Tree representations of graphs
Sort
View
JCDL
2004
ACM
94views Education» more  JCDL 2004»
16 years 8 days ago
Element matching in concept maps
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...
Byron Marshall, Therani Madhusudan
FORMATS
2004
Springer
16 years 7 days ago
Learning of Event-Recording Automata
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
Olga Grinchtein, Bengt Jonsson, Martin Leucker
SAS
2004
Springer
16 years 6 days ago
A Polynomial-Time Algorithm for Global Value Numbering
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
Sumit Gulwani, George C. Necula
SIGADA
2004
Springer
16 years 6 days ago
A refactoring tool for Ada 95
Refactoring is a technique for restructuring code to improve its design. A tool for automatically applying refactoring transformations to Ada 95 programs is described. The tool is...
Paul Anderson
DAWAK
2003
Springer
16 years 2 days ago
Designing Web Warehouses from XML Schemas
Web warehousing plays a key role in providing the managers with up-to-date and comprehensive information about their business domain. On the other hand, since XML is now a standard...
Boris Vrdoljak, Marko Banek, Stefano Rizzi