558 search results - page 103 / 112 » On Graphs in Conceptual Engineering Design |
119
Voted
WWW
2005
ACM
16 years 4 months ago
2005
ACM
This work aims a two-fold contribution: it presents a software to analyse logfiles and visualize popular web hot spots and, additionally, presents an algorithm to use this informa...
137
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
160
Voted
GROUP
2005
ACM
15 years 9 months ago
2005
ACM
People search for people with suitable expertise all of the time in their social networks – to answer questions or provide help. Recently, efforts have been made to augment this...
119
Voted
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
120
click to vote
INFOVIS
2003
IEEE
15 years 9 months ago
2003
IEEE
Many networks under study in Information Visualization are “small world” networks. These networks first appeared in the study social networks and were shown to be relevant mod...