Sciweavers

2125 search results - page 92 / 425
» On Graph Complexity
Sort
View
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
14 years 8 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
13 years 11 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
TSP
2010
13 years 2 months ago
Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
Jiasong Wu, Huazhong Shu, Lu Wang, Lotfi Senhadji
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 7 months ago
The Complexity of Proving the Discrete Jordan Curve Theorem
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
Phuong Nguyen, Stephen Cook
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 7 months ago
Structure and Value Synopses for XML Data Graphs
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
Neoklis Polyzotis, Minos N. Garofalakis