5606 search results - page 340 / 1122 » Randomization Techniques for Graphs. |
138
click to vote
ICCD
2000
IEEE
16 years 3 months ago
2000
IEEE
This paper presents a very general, exact technique for scheduling looping data-flow graphs. In contrast to the conventional technique using loop iteration variables and integer ...
151
click to vote
INFOVIS
2005
IEEE
16 years 6 days ago
2005
IEEE
The general problem of visualizing “family trees”, or genealogical graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs...
151
click to vote
APSEC
2004
IEEE
15 years 10 months ago
2004
IEEE
Software engineers need to understand programs in order to effectively maintain them. The call graph, which presents the calling relationships between functions, is a useful repre...
168
click to vote
HHCI
2000
15 years 10 months ago
2000
In this paper we discuss the design of computer-based haptic graphs for blind and visually impaired people with the support of our preliminary experimental results. Since visual i...
183
click to vote
SSPR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In order to use structural techniques from graph-based pattern recognition, a first necessary step consists in extracting a graph in an automatic way from an image. We pr...