@inproceedings{DBLP:conf/bpm/MendlingRC07, author = {Jan Mendling and Hajo A. Reijers and Jorge Cardoso}, title = {What Makes Process Models Understandable?}, booktitle = {BPM}, year = {2007}, pages = {48-63}, ee = {http://dx.doi.org/10.1007/978-3-540-75183-0_4}, crossref = {DBLP:conf/bpm/2007}, bibsource = {DBLP, http://dblp.uni-trier.de} }
Exemplary sites covered here include: WikiViz, FreeMind, Visualizious, Tree Radial Balloon Layout, Comment Flow, OneWord, Del.icio.us Network Explorer, Bubbl.us, ClusterBall, and data visualization of a social network.
VisualComplexity.com intends to be a unified resource space for anyone interested in the visualization of complex networks. The project's main goal is to leverage a critical understanding of different visualization methods, across a series of disciplines, as diverse as Biology, Social Networks or the World Wide Web. I truly hope this space can inspire, motivate and enlighten any person doing research on this field.
E. Michailidou, S. Harper, and S. Bechhofer. SIGDOC '08: Proceedings of the 26th annual ACM international conference on Design of communication, page 215--224. New York, NY, USA, ACM, (September 2008)
A. Broadbent, J. Fitzsimons, and E. Kashefi. (2008)cite arxiv:0807.4154
Comment: 16 pages, 7 figures. This version contains a more detailed security
proof and expanded authentication protocol. Section 5 contains news results:
we prove that any problem in BQP has an entangled two-prover interactive
proof with the provers being restricted to BQP and a purely classical
verifier.