Sciweavers

3757 search results - page 173 / 752
» The overlap number of a graph
Sort
View
EON
2007
15 years 7 months ago
Benchmarking Reasoners for Multi-Ontology Applications
We describe an approach to create a synthetic workload for large scale extensional query answering experiments. The workload comprises multiple interrelated domain ontologies, data...
Ameet Chitnis, Abir Qasem, Jeff Heflin
DM
2008
55views more  DM 2008»
15 years 6 months ago
Improved pebbling bounds
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
Melody Chan, Anant P. Godbole
JCT
2006
73views more  JCT 2006»
15 years 6 months ago
Colouring lines in projective space
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the kdimensional subspaces of V as its vertices, where two subspaces and are adjacent if and...
Ameera Chowdhury, Chris D. Godsil, Gordon F. Royle
ICDM
2006
IEEE
149views Data Mining» more  ICDM 2006»
16 years 14 days ago
Pattern Mining in Frequent Dynamic Subgraphs
Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowl...
Karsten M. Borgwardt, Hans-Peter Kriegel, Peter Wa...
INFOCOM
2003
IEEE
15 years 11 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...