51 search results - page 3 / 11 » A new algorithm for removing node overlapping in graph visua... |
SP
2009
IEEE
14 years 14 days ago
2009
IEEE
Operators of online social networks are increasingly sharing potentially sensitive information about users and their relationships with advertisers, application developers, and da...
IV
2005
IEEE
13 years 11 months ago
2005
IEEE
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
TROB
2008
13 years 5 months ago
2008
This paper presents a vision-based approach to SLAM in indoor / outdoor environments with minimalistic sensing and computational requirements. The approach is based on a graph repr...
ASPDAC
2001
ACM
13 years 9 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
APVIS
2009
13 years 6 months ago
2009
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". Social networks are typic...