Sciweavers

248 search results - page 32 / 50
» On the Cayley isomorphism problem
Sort
View
IWCIA
2009
Springer
15 years 4 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
ECCC
2006
134views more  ECCC 2006»
14 years 9 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao
CVPR
2008
IEEE
15 years 11 months ago
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
15 years 3 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu
MFCS
2004
Springer
15 years 3 months ago
A Protocol for Serializing Unique Strategies
Abstract. We devise an efficient protocol by which a series of twoperson games Gi with unique winning strategies can be combined into a single game G with unique winning strategy, ...
Marcel Crâsmaru, Christian Glaßer, Ken...