Sciweavers

977 search results - page 115 / 196
» Social networks generate interest in computer science
Sort
View
ICCTA
2007
IEEE
15 years 5 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
CGF
2011
14 years 5 months ago
Dynamic Insets for Context-Aware Graph Navigation
Maintaining both overview and detail while navigating in graphs, such as road networks, airline route maps, or social networks, is difficult, especially when targets of interest ...
S. Ghani, N. Henry Riche, N. Elmqvist
PARA
2000
Springer
15 years 5 months ago
Experiments in Separating Computational Algorithm from Program Distribution and Communication
Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yie...
Raphael B. Yehezkael, Yair Wiseman, H. G. Mendelba...
SDM
2010
SIAM
146views Data Mining» more  SDM 2010»
15 years 3 months ago
Towards Finding Valuable Topics
Enterprises depend on their information workers finding valuable information to be productive. However, existing enterprise search and recommendation systems can exploit few studi...
Zhen Wen, Ching-Yung Lin
COMPLEX
2009
Springer
15 years 6 months ago
A Max-Min Principle for Phyllotactic Patterns
Abstract. An interesting phenomenon about phyllotaxis is the divergence angle between two consecutive primordia. In this paper, we consider a dynamic model based on Max-Min princip...
Wai-Ki Ching, Yang Cong, Nam-Kiu Tsing