Sciweavers

197 search results - page 21 / 40
» The Invariants of the Clifford Groups
Sort
View
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 29 days ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
IJAC
2002
128views more  IJAC 2002»
13 years 7 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki
IJCV
2006
145views more  IJCV 2006»
13 years 7 months ago
Simultaneous Object Recognition and Segmentation from Single or Multiple Model Views
We present a novel Object Recognition approach based on affine invariant regions. It actively counters the problems related to the limited repeatability of the region detectors, an...
Vittorio Ferrari, Tinne Tuytelaars, Luc J. Van Goo...
ICPR
2008
IEEE
14 years 8 months ago
Robust shape normalization based on implicit representations
We introduce a new shape normalization method based on implicit shape representations. The proposed method is robust with respect to deformations and invariant to similarity trans...
Carlo Tomasi, Tingting Jiang
CVPR
2008
IEEE
14 years 9 months ago
ANSIG - An analytic signature for permutation-invariant two-dimensional shape representation
Many applications require a computer representation of 2D shape, usually described by a set of 2D points. The challenge of this representation is that it must not only capture the...
José J. Rodrigues, Pedro M. Q. Aguiar, Jo&a...