Sciweavers

712 search results - page 89 / 143
» On Spectral Graph Drawing
Sort
View
SODA
2008
ACM
112views Algorithms» more  SODA 2008»
13 years 10 months ago
The effect of induced subgraphs on quasi-randomness
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
Asaf Shapira, Raphael Yuster
DAGSTUHL
2006
13 years 10 months ago
Many-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...
ESA
1993
Springer
109views Algorithms» more  ESA 1993»
14 years 1 months ago
Optimal Upward Planarity Testing of Single-Source Digraphs
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
Paola Bertolazzi, Giuseppe Di Battista, Carlo Mann...
APVIS
2001
13 years 10 months ago
Information Visualisation using Composable Layouts and Visual Sets
This paper demonstrates the application of graph drawing and information visualisation techniques to the visualisation of information which can be modelled as an attributed graph....
Tim Pattison, Rudi Vernik, Matthew Phillips
TSP
2008
94views more  TSP 2008»
13 years 8 months ago
Optimal Particle Filters for Tracking a Time-Varying Harmonic or Chirp Signal
We consider the problem of tracking the time-varying (TV) parameters of a harmonic or chirp signal using particle filtering (PF) tools. Similar to previous PF approaches to TV spec...
E. E. Tsakonas, Nicholas D. Sidiropoulos, Ananthra...