1101 search results - page 79 / 221 » An Algorithm for the Graph Crossing Number Problem |
103
click to vote
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
In a reverberant scenario, phase transformed weighted algorithms are more robust than Maximum Likelihood (ML) because of the insufficiency of the data model to incorporate reverb...
134
click to vote
DAM
2007
15 years 2 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
126
Voted
PODC
2006
ACM
15 years 8 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
143
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
107
click to vote
ICTAI
2000
IEEE
15 years 7 months ago
2000
IEEE
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial con...