Sciweavers

99 search results - page 8 / 20
» On a class of finite symmetric graphs
Sort
View
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 8 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
PAMI
2010
260views more  PAMI 2010»
13 years 6 months ago
Unsupervised Object Segmentation with a Hybrid Graph Model (HGM)
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
Guangcan Liu, Zhouchen Lin, Yong Yu, Xiaoou Tang
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 8 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
DM
2008
86views more  DM 2008»
13 years 8 months ago
Hamiltonian properties of triangular grid graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
Valery S. Gordon, Yury L. Orlovich, Frank Werner
SIAMNUM
2010
150views more  SIAMNUM 2010»
13 years 3 months ago
Quasi-Optimal Convergence Rate of an Adaptive Discontinuous Galerkin Method
We analyze an adaptive discontinuous finite element method (ADFEM) for symmetric second order linear elliptic operators. The method is formulated on nonconforming meshes made of si...
Andrea Bonito, Ricardo H. Nochetto