5022 search results - page 97 / 1005 » Data structures and problem solving using Java |
ACSC
2002
IEEE
15 years 2 months ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
ICTAC
2010
Springer
14 years 7 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
KRDB
1994
14 years 11 months ago
1994
This paper presents, fromthe author's perspective, the problems that occur in practice during data modelling. The author's experiences are a result of a considerable num...
ECML
1991
Springer
15 years 1 months ago
1991
Springer
Robust reasoning requires learning from problem solving episodes. Past experience must be compiled to provide adaptation to new contingencies and intelligent modification of solut...
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...