Sciweavers

1162 search results - page 42 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
15 years 9 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
164
Voted
JDCTA
2010
148views more  JDCTA 2010»
14 years 10 months ago
Application Research on Optimal Path Based on Genetic Algorithm
At present, China's automobile logistics cost accounts for more than 20% of the production of motor vehicles. Therefore, lowering logistics cost by seeking its best path is a...
Lilin Fan, Huili Meng
SIGMOD
2008
ACM
89views Database» more  SIGMOD 2008»
16 years 4 months ago
Towards identity anonymization on graphs
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
Kun Liu, Evimaria Terzi
ICDM
2002
IEEE
178views Data Mining» more  ICDM 2002»
15 years 8 months ago
gSpan: Graph-Based Substructure Pattern Mining
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
Xifeng Yan, Jiawei Han
IROS
2006
IEEE
111views Robotics» more  IROS 2006»
15 years 10 months ago
A Combined Monte-Carlo Localization and Tracking Algorithm for RoboCup
— Self-localization is a major research task in mobile robotics for several years. Efficient self-localization methods have been developed, among which probabilistic Monte-Carlo...
Patrick Heinemann, Jürgen Haase, Andreas Zell