Sciweavers

1307 search results - page 39 / 262
» Follow the intellectual property
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 12 months ago
Quasi-randomness of graph balanced cut properties
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
Hao Huang, Choongbum Lee
CORR
2006
Springer
90views Education» more  CORR 2006»
14 years 12 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
NN
2006
Springer
100views Neural Networks» more  NN 2006»
14 years 11 months ago
Perceiving the unusual: Temporal properties of hierarchical motor representations for action perception
Recent computational approaches to action imitation have advocated the use of hierarchical representations in the perception and imitation of demonstrated actions. Hierarchical re...
Yiannis Demiris, Gavin Simmons
MICS
2010
134views more  MICS 2010»
14 years 10 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
ISAAC
2010
Springer
230views Algorithms» more  ISAAC 2010»
14 years 9 months ago
Seidel Minor, Permutation Graphs and Combinatorial Properties
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
Vincent Limouzy