1127 search results - page 136 / 226 » Testing the Expansion of a Graph |
WEA
2009
Springer
15 years 4 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
SEFM
2008
IEEE
15 years 4 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
COCOA
2007
Springer
15 years 4 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
DIAL
2006
IEEE
15 years 3 months ago
2006
IEEE
It is an important topic for segmentation on how to merge the over-segmented subimages of characters into integral characters. The conventional character segmentation has been mos...