We now have incrementally-grown databases of text documents ranging back for over a decade in areas ranging from personal email, to news-articles and conference proceedings. While...
Understanding and analyzing complex volumetrically varying data is a difficult problem. Many computational visualization techniques have had only limited success in succinctly po...
Nikolai A. Svakhine, Yun Jang, David S. Ebert, Kel...
The objective of this study is to identify the relationships in which social support influences flow and game loyalty through character control, character identity, guild identity...
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Social networking services well know that some users are unwilling to freely share the information they store with the service (e.g. profile information). To address this, servic...