2463 search results - page 284 / 493 » Rankings of Directed Graphs |
123
click to vote
ICHIT
2009
Springer
15 years 10 months ago
2009
Springer
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
104
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
125
click to vote
SEFM
2008
IEEE
15 years 10 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 ...
115
click to vote
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract: An original technique to transform functional representation of the design into a structural representation in form of a data flow graph (DFG) is described. A canonical,...
139
click to vote
IV
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper presents a novel technique for exploring and navigating large hierarchies, not restricted to trees but to directed acyclic graphs (dags). The technique combines two dif...