Sciweavers

1605 search results - page 205 / 321
» On Partitional Labelings of Graphs
Sort
View
VCIP
2003
132views Communications» more  VCIP 2003»
13 years 11 months ago
Layered self-identifiable and scalable video codec for delivery to heterogeneous receivers
This paper describes the development of a layered structure of a multi-resolutional scalable video codec based on the Color Set Partitioning in Hierarchical Trees (CSPIHT) scheme....
Wei Feng, Ashraf A. Kassim, Chen-Khong Tham
ENTCS
2008
105views more  ENTCS 2008»
13 years 10 months ago
Checking Equivalence for Reo Networks
Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...
Tobias Blechmann, Christel Baier
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
13 years 10 months ago
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...
COMBINATORICS
1999
99views more  COMBINATORICS 1999»
13 years 9 months ago
Deformation of Chains via a Local Symmetric Group Action
A symmetric group action on the maximal chains in a finite, ranked poset is local if the adjacent transpositions act in such a way that (i, i + 1) sends each maximal chain either ...
Patricia Hersh
ICIP
2009
IEEE
13 years 7 months ago
Learning weighted similarity measurements for unconstrained face recognition
Unconstrained face recognition is the problem of deciding if an image pair is showing the same individual or not, without having class specific training material or knowing anythi...
Andre Störmer, Gerhard Rigoll