Sciweavers

161 search results - page 15 / 33
» Setting port numbers for fast graph exploration
Sort
View
ICIAR
2010
Springer
13 years 5 months ago
Image Segmentation for Robots: Fast Self-adapting Gaussian Mixture Model
Image segmentation is a critical low-level visual routine for robot perception. However, most image segmentation approaches are still too slow to allow real-time robot operation. I...
Nicola Greggio, Alexandre Bernardino, José ...
GD
2006
Springer
13 years 11 months ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel
KRDB
1998
83views Database» more  KRDB 1998»
13 years 9 months ago
Semantic Query Optimisation and Rule Graphs
Previous researchers note the problem for semantic optimisation of database queries caused by its production of a large number of semantically equivalent alternative queries, from...
Jerome Robinson, Barry G. T. Lowden
INFOVIS
2000
IEEE
14 years 4 days ago
Visualizing Massive Multi-Digraphs
We describe MGV, an integrated visualization and exploration system for massive multi-digraph navigation. MGV’s only assumption is that the vertex set of the underlying digraph ...
James Abello, Jeffrey L. Korn
SSDBM
2010
IEEE
185views Database» more  SSDBM 2010»
13 years 6 months ago
DESSIN: Mining Dense Subgraph Patterns in a Single Graph
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
Shirong Li, Shijie Zhang, Jiong Yang