Sciweavers

201 search results - page 37 / 41
» The Connectivity of addition Cayley graphs
Sort
View
CIKM
2009
Springer
14 years 6 hour ago
iMecho: an associative memory based desktop search system
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...
Jidong Chen, Hang Guo, Wentao Wu, Wei Wang 0009
PODC
2009
ACM
14 years 8 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
14 years 21 days ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
SIGADA
1999
Springer
13 years 11 months ago
Redistribution in distributed Ada
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
Scott James
GRAPHICSINTERFACE
2007
13 years 8 months ago
Can smooth view transitions facilitate perceptual constancy in node-link diagrams?
Many visualizations use smoothly animated transitions to help the user interact with information structures. These transitions are intended to preserve perceptual constancy during...
Maruthappan Shanmugasundaram, Pourang Irani, Carl ...