Sciweavers

5100 search results - page 268 / 1020
» The Linear Complexity of a Graph
Sort
View
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
16 years 4 months ago
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and m...
Sitaram Asur, Srinivasan Parthasarathy, Duygu Ucar
DIAGRAMS
2006
Springer
15 years 8 months ago
Toward a Comprehensive Model of Graph Comprehension: Making the Case for Spatial Cognition
We argue that a comprehensive model of graph comprehension must include spatial cognition. We propose that current models of graph comprehension have not needed to incorporate spat...
Susan Bell Trickett, J. Gregory Trafton
WG
2010
Springer
15 years 2 months ago
Colouring Vertices of Triangle-Free Graphs
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Ber...
AAECC
2006
Springer
120views Algorithms» more  AAECC 2006»
15 years 4 months ago
Continued fraction for formal laurent series and the lattice structure of sequences
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Wilfried Meidl
ECAI
2010
Springer
15 years 5 months ago
Discovering an Event Taxonomy from Video using Qualitative Spatio-temporal Graphs
This work proposes a graph mining based approach to mine a taxonomy of events from activities for complex videos which are represented in terms of qualitative spatio-temporal relat...
Muralikrishna Sridhar, Anthony G. Cohn, David C. H...