Sciweavers

394 search results - page 30 / 79
» Testing subgraphs in large graphs
Sort
View
DM
2000
150views more  DM 2000»
13 years 8 months ago
A note on generalized chromatic number and generalized girth
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
Béla Bollobás, Douglas B. West
CVPR
2010
IEEE
13 years 7 months ago
Common visual pattern discovery via spatially coherent correspondences
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
Hairong Liu, Shuicheng Yan
INFOCOM
2003
IEEE
14 years 2 months ago
Sampling Biases in IP Topology Measurements
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
Anukool Lakhina, John W. Byers, Mark Crovella, Pen...
ICML
2007
IEEE
14 years 9 months ago
Entire regularization paths for graph data
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda
DAGSTUHL
2001
13 years 10 months ago
Visualizing Memory Graphs
To understand the dynamics of a running program, it is often useful to examine its state at specific moments during its execution. We present memory graphs as a means to capture an...
Thomas Zimmermann, Andreas Zeller