Sciweavers

1749 search results - page 176 / 350
» Conditional colorings of graphs
Sort
View
PAMI
2007
155views more  PAMI 2007»
15 years 6 months ago
Localization of Shapes Using Statistical Models and Stochastic Optimization
—In this paper, we present a new model for deformations of shapes. A pseudolikelihood is based on the statistical distribution of the gradient vector field of the gray level. The...
François Destrempes, Max Mignotte, Jean-Fra...
COMBINATORICA
2007
126views more  COMBINATORICA 2007»
15 years 6 months ago
Privileged users in zero-error transmission over a noisy channel
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
Noga Alon, Eyal Lubetzky
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
15 years 8 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
DM
2007
103views more  DM 2007»
15 years 6 months ago
Minimum cycle bases of graphs on surfaces
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
Han Ren, Mo Deng
COMBINATORICA
2011
14 years 6 months ago
A local criterion for Tverberg graphs
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
Alexander Engström