Sciweavers

1097 search results - page 102 / 220
» Testing Graph Isomorphism
Sort
View
COMPGEOM
2006
ACM
15 years 4 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
CORR
2007
Springer
87views Education» more  CORR 2007»
14 years 10 months ago
Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
Animashree Anandkumar, Lang Tong, Ananthram Swami
ITSSA
2006
91views more  ITSSA 2006»
14 years 10 months ago
Organization Detection Using Emergent Computing
: Organization is a central concept in systems. In this paper an ant algorithm for detecting organizations is presented. In a discrete-time context, at each time-step, an organizat...
Cyrille Bertelle, Antoine Dutot, Fréd&eacut...
ACIVS
2005
Springer
15 years 3 months ago
Image Registration Using Uncertainty Transformations
Abstract. In this work we introduce a new technique for a frequently encountered problem in computer vision: image registration. The registration is computed by matching features, ...
Kristof Teelen, Peter Veelaert
APN
2001
Springer
15 years 2 months ago
Rewriting Logic as a Unifying Framework for Petri Nets
We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by in...
Mark-Oliver Stehr, José Meseguer, Peter Csa...