54 search results - page 6 / 11 » Forcing highly connected subgraphs |
107
click to vote
VR
2000
IEEE
15 years 1 months ago
2000
IEEE
This paper describes how a physical simulation can be integrated with our Responsive Workbench system to support complex assembly tasks involving multiple hands and users. Our sys...
IM
2008
14 years 9 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
128
Voted
VDA
2010
14 years 12 months ago
2010
While there have been intensive efforts in developing better 3D flow visualization techniques, little attention has been paid to the design of better user interfaces and more effe...
115
click to vote
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
KDD
2008
ACM
15 years 9 months ago
2008
ACM
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...