Sciweavers

829 search results - page 51 / 166
» Distance domination-critical graphs
Sort
View
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
15 years 1 months ago
Matching planar maps
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
Helmut Alt, Alon Efrat, Günter Rote, Carola W...
KDD
2005
ACM
140views Data Mining» more  KDD 2005»
16 years 8 days ago
Graphs over time: densification laws, shrinking diameters and possible explanations
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
Jure Leskovec, Jon M. Kleinberg, Christos Faloutso...
SAC
2009
ACM
15 years 6 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang
ASUNAM
2009
IEEE
15 years 6 months ago
Social Network Model Based on Keyword Categorization
A user profile on an online social network is characterized by its profile entries (keywords). In this paper, we study the relationship between semantic similarity of user keywo...
Prantik Bhattacharyya, Ankush Garg, Shyhtsun Felix...
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
15 years 5 months ago
Coverage Diameters of Polygons
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
Pawin Vongmasa, Attawith Sudsang