1794 search results - page 200 / 359 » Visualizing Memory Graphs |
166
Voted
JGAA
2002
15 years 5 months ago
2002
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
140
click to vote
SPATIALCOGNITION
2004
Springer
15 years 11 months ago
2004
Springer
Cities on a map that are directly connected by a route are judged closer than unconnected cities. This route effect has been attributed to memory distortions induced by the integra...
145
click to vote
SIGCSE
2000
ACM
15 years 10 months ago
2000
ACM
We describe a Web-based interactive system, called PILOT, for testing computer science concepts. The strengths of PILOT are its universal access and platform independence, its use...
192
Voted
FM
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
191
click to vote
KAIS
2011
15 years 1 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...