1201 search results - page 117 / 241 » Linear Probing and Graphs |
92
Voted
ISAAC
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...
143
Voted
GLOBECOM
2010
IEEE
14 years 10 months ago
2010
IEEE
High demands in data delivery latency and communication reliability encourage the use of fault-toleranceenhanced all-optical WDM networks. Low latency is satisfied by setting up a ...
111
Voted
ICMCS
2007
IEEE
15 years 7 months ago
2007
IEEE
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
147
click to vote
COMGEO
2012
ACM
13 years 8 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
109
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...