3396 search results - page 545 / 680 » Tree representations of graphs |
134
Voted
JCDL
2004
ACM
15 years 10 months ago
2004
ACM
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...
133
click to vote
FORMATS
2004
Springer
15 years 10 months ago
2004
Springer
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...
126
click to vote
SAS
2004
Springer
15 years 10 months ago
2004
Springer
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...
127
click to vote
SIGADA
2004
Springer
15 years 10 months ago
2004
Springer
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...
147
click to vote
DAWAK
2003
Springer
15 years 10 months ago
2003
Springer
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...