Sciweavers

3702 search results - page 70 / 741
» All Pairings Are in a Group
Sort
View
IJAC
2007
59views more  IJAC 2007»
15 years 6 months ago
Polynomial-Time Complexity for Instances of the Endomorphism Problem in Free Groups
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
Laura Ciobanu
P2P
2008
IEEE
16 years 1 months ago
Flexible Routing in Grouped DHTs
In most DHTs proposed so far, all nodes are assumed to be homogeneous, and all messages are routed using a common algorithm. In practice, however, nodes in large-scale systems mig...
Yiming Zhang, Dongsheng Li, Lei Chen 0002, Xicheng...
COMBINATORICS
2000
103views more  COMBINATORICS 2000»
15 years 6 months ago
The Action of the Symmetric Group on a Generalized Partition Semilattice
Given an integer n 2, and a non-negative integer k, consider all affine hyperplanes in Rn of the form xi = xj +r for i, j [n] and a non-negative integer r k. Let n,k be the pos...
Robert Gill
CORR
2008
Springer
105views Education» more  CORR 2008»
15 years 7 months ago
On Full Diversity Space-Time Block Codes with Partial Interference Cancellation Group Decoding
In this paper, we propose a partial interference cancellation (PIC) group decoding strategy/scheme for linear dispersive space-time block codes (STBC) and a design criterion for th...
Xiaoyong Guo, Xiang-Gen Xia
DSN
2002
IEEE
15 years 11 months ago
Optimizing Buffer Management for Reliable Multicast
Reliable multicast delivery requires that a multicast message be received by all members in a group. Hence certain or all members need to buffer messages for possible retransmissi...
Zhen Xiao, Kenneth P. Birman, Robbert van Renesse