Sciweavers

1949 search results - page 102 / 390
» Random graphs on surfaces
Sort
View
129
Voted
RSA
2008
69views more  RSA 2008»
15 years 3 months ago
Local resilience of graphs
: In this article, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (local...
Benny Sudakov, Van H. Vu
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
15 years 10 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
151
Voted
CGF
2002
94views more  CGF 2002»
15 years 4 months ago
Multiresolution Surfaces having Arbitrary Topologies by a Reverse Doo Subdivision Method
We have shown how to construct multiresolution structures for reversing subdivision rules using global least squares models 16. As a result, semiorthogonal wavelet systems have al...
Faramarz F. Samavati, N. Mahdavi-Amiri, Richard M....
SIGGRAPH
1998
ACM
15 years 8 months ago
An Anthropometric Face Model Using Variational Techniques
We describe a system that automatically generates varied geometric models of human faces. A collection of random measurements of the face is generated according to anthropometric ...
Douglas DeCarlo, Dimitris N. Metaxas, Matthew Ston...
119
Voted
IBPRIA
2005
Springer
15 years 9 months ago
Fast Surface Grading Using Color Statistics in the CIE Lab Space
In this paper we approach the problem of fast surface grading of flat pieces decorated with random patterns. The proposed method is based on the use of global statistics of color ...
Fernando López, José Miguel Valiente...