Sciweavers

251 search results - page 41 / 51
» When Size Does Matter
Sort
View
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
15 years 11 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
COMPLEX
2009
Springer
15 years 5 months ago
On General Laws of Complex Networks
By introducing and analyzing a renormalization procedure, Song et al. [1] draw the conclusion that many complex networks exhibit self-repeating patterns on all length scales. First...
Wenjun Xiao, Limin Peng, Behrooz Parhami
SASO
2008
IEEE
15 years 5 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau
DIAGRAMS
2008
Springer
15 years 13 days ago
Graphical Revelations: Comparing Students' Translation Errors in Graphics and Logic
We are interested in developing a better understanding of what it is that students find difficult in learning logic. We use both natural language and diagram-based methods for teac...
Richard Cox, Robert Dale, John Etchemendy, Dave Ba...
ENTCS
2007
87views more  ENTCS 2007»
14 years 10 months ago
A Study on the Practicality of Poly-Controlled Partial Evaluation
Poly-controlled partial evaluation (PCPE) is a flexible approach for specializing logic programs, which has been recently proposed. It takes into account repertoires of global co...
Claudio Ochoa, Germán Puebla