Sciweavers

243 search results - page 23 / 49
» Listing All Plane Graphs
Sort
View
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
13 years 11 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
13 years 12 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
GD
2005
Springer
14 years 1 months ago
Graph Treewidth and Geometric Thickness Parameters
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
Vida Dujmovic, David R. Wood
APVIS
2006
13 years 9 months ago
Visual analysis of network centralities
Centrality analysis determines the importance of vertices in a network based on their connectivity within the network structure. It is a widely used technique to analyse network-s...
Tim Dwyer, Seok-Hee Hong, Dirk Koschützki, Fa...
ICASSP
2011
IEEE
12 years 11 months ago
A novel algorithm for occlusions and perspective effects using a 3D object process
In this paper, we introduce a novel probabilistic approach to handle occlusions and perspective effects. The proposed method is an object based method embedded in a marked point p...
Ahmed Gamal-Eldin, Xavier Descombes, Josiane Zerub...