Sciweavers

3068 search results - page 443 / 614
» Clustering with Multiple Graphs
Sort
View
VLDB
2004
ACM
138views Database» more  VLDB 2004»
15 years 11 months ago
ObjectRank: Authority-Based Keyword Search in Databases
The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containin...
Andrey Balmin, Vagelis Hristidis, Yannis Papakonst...
ICRA
2003
IEEE
146views Robotics» more  ICRA 2003»
15 years 11 months ago
An atlas framework for scalable mapping
Abstract— This paper describes Atlas, a hybrid metrical/topological approach to SLAM that achieves efficient mapping of large-scale environments. The representation is a graph o...
Michael Bosse, Paul M. Newman, John J. Leonard, Ma...
ICPP
1996
IEEE
15 years 10 months ago
Polynomial-Time Nested Loop Fusion with Full Parallelism
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
Edwin Hsing-Mean Sha, Chenhua Lang, Nelson L. Pass...
VISSYM
2007
15 years 8 months ago
Path Visualization for Adjacency Matrices
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far ...
Zeqian Shen, Kwan-Liu Ma
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 8 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze