361 search results - page 6 / 73 » Algorithms for Extracting Timeliness Graphs |
PERCOM
2010
ACM
13 years 7 months ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
DATE
2006
IEEE
14 years 8 days ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
IMCSIT
2010
13 years 3 months ago
2010
We formulate a novel problem of summarising entities with limited presentation budget on entity-relationship knowledge graphs and propose an efficient algorithm for solving this pr...
IWPC
2000
IEEE
14 years 29 days ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...