Sciweavers

1302 search results - page 22 / 261
» Fair Equivalence Relations
Sort
View
APAL
2006
57views more  APAL 2006»
13 years 7 months ago
Effective categoricity of equivalence structures
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
Wesley Calvert, Douglas Cenzer, Valentina S. Hariz...
COMCOM
2004
110views more  COMCOM 2004»
13 years 7 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu
ITA
2008
111views Communications» more  ITA 2008»
13 years 7 months ago
A new algebraic invariant for weak equivalence of sofic subshifts
It is studied how taking the inverse image by a sliding block code affects the syntactic semigroup of a sofic subshift. Two independent approaches are used: -semigroups as recogni...
Laura Chaubard, Alfredo Costa
MSCS
2007
117views more  MSCS 2007»
13 years 7 months ago
Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less ...
Michele Pagani
CVPR
2005
IEEE
14 years 9 months ago
Identifying Semantically Equivalent Object Fragments
We describe a novel technique for identifying semantically equivalent parts in images belonging to the same object class, (e.g. eyes, license plates, aircraft wings etc.). The vis...
Boris Epshtein, Shimon Ullman