328 search results - page 34 / 66 » Algorithms for the edge-width of an embedded graph |
ICASSP
2010
IEEE
14 years 12 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
100
click to vote
MOBIHOC
2005
ACM
15 years 11 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
108
click to vote
COMGEO
2004
ACM
14 years 11 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
103
click to vote
WWW
2008
ACM
16 years 14 days ago
2008
ACM
The Web offers rich relational data with different semantics. In this paper, we address the problem of document recommendation in a digital library, where the documents in questio...
COMAD
2009
15 years 27 days ago
2009
The focus of this paper is to develop algorithms and a framework for modeling transactional data stored in relational database into graphs for mining. Most of the real-world trans...