Sciweavers

267 search results - page 23 / 54
» Signatures of Combinatorial Maps
Sort
View
CDC
2009
IEEE
158views Control Systems» more  CDC 2009»
15 years 3 months ago
Multiple target detection using Bayesian learning
In this paper, we study multiple target detection using Bayesian learning. The main aim of the paper is to present a computationally efficient way to compute the belief map update ...
Sujit Nair, Konda Reddy Chevva, Houman Owhadi, Jer...
TCS
2010
14 years 6 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal
COMBINATORICS
2006
132views more  COMBINATORICS 2006»
14 years 12 months ago
On Computing the Distinguishing Numbers of Trees and Forests
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
Christine T. Cheng
JCT
2008
78views more  JCT 2008»
14 years 11 months ago
A partition bijection related to the Rogers-Selberg identities and Gordon's theorem
We provide a bijective map from the partitions enumerated by the series side of the Rogers-Selberg mod 7 identities onto partitions associated with a special case of Basil Gordon&...
Andrew V. Sills
IMA
2009
Springer
124views Cryptology» more  IMA 2009»
15 years 6 months ago
Comparing with RSA
A multi-set (ms) is a set where an element can occur more than once. ms hash functions (mshfs) map mss of arbitrary cardinality to fixed-length strings. This paper introduces a ne...
Julien Cathalo, David Naccache, Jean-Jacques Quisq...