9532 search results - page 417 / 1907 » Logic, Graphs, and Algorithms |
209
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
161
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
––This paper describes algorithms for automatic layout synthesisofleafcellsin1–dandinanew1–1/2–dlayoutstyle,useful for non–dual circuit styles. The graph theory based a...
161
click to vote
ISCC
2006
IEEE
16 years 25 days ago
2006
IEEE
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
208
click to vote
ICDE
2010
IEEE
16 years 4 days ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
172
click to vote
COLING
2008
15 years 8 months ago
2008
This paper describes a parameter estimation method for multi-label classification that does not rely on approximate inference. It is known that multi-label classification involvin...