Sciweavers

1115 search results - page 24 / 223
» Separating Shape Graphs
Sort
View
ICNP
2009
IEEE
14 years 3 months ago
Scalable IP Lookups using Shape Graphs
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
TACAS
2007
Springer
74views Algorithms» more  TACAS 2007»
14 years 2 months ago
Shape Analysis by Graph Decomposition
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
Roman Manevich, Josh Berdine, Byron Cook, G. Ramal...
TVLSI
2002
161views more  TVLSI 2002»
13 years 8 months ago
Arbitrarily shaped rectilinear module placement using the transitive closure graph representation
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
Jai-Ming Lin, Hsin-Lung Chen, Yao-Wen Chang
ICPR
2006
IEEE
14 years 9 months ago
Bin-Picking based on Harmonic Shape Contexts and Graph-Based Matching
In this work we address the general bin-picking problem where 3D data is available. We apply Harmonic Shape Contexts (HSC) features since these are invariant to translation, scale...
Jakob Kirkegaard, Thomas B. Moeslund
APIN
1999
114views more  APIN 1999»
13 years 8 months ago
Evolutionary Approaches to Figure-Ground Separation
The problem of figure-ground separation is tackled from the perspective of combinatorial optimization. Previous attempts have used deterministic optimization techniques based on re...
Suchendra M. Bhandarkar, Xia Zeng