Sciweavers

5019 search results - page 25 / 1004
» Computing in Quotient Groups
Sort
View
145
Voted
GROUP
2010
ACM
14 years 12 months ago
Towards a group recommender process model for ad-hoc groups and on-demand recommendations
Movie recommender systems simplify the movie selection by providing movie suggestions based on the respective user's personal taste. Most of the current systems address indiv...
Christoph Beckmann, Tom Gross
ICPADS
2005
IEEE
15 years 7 months ago
Group Communication Protocol for Autonomic Computing
: We discuss a group protocol which supports applications with group communication service when QoS supported by networks or required by applications is changed. An autonomic group...
Tomoya Enokido, Makoto Takizawa
105
Voted
ISSAC
2000
Springer
94views Mathematics» more  ISSAC 2000»
15 years 5 months ago
Computing normalizers of permutation groups efficiently using isomorphisms of association schemes
This note presents an algorithm to speed up the computation of normalizers of permutation groups. It is an application of computation of isomorphisms of association schemes. Categ...
Izumi Miyamoto
APAL
2011
14 years 9 months ago
The complexity of central series in nilpotent computable groups
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
Barbara F. Csima, Reed Solomon
115
Voted
ICDCS
2003
IEEE
15 years 7 months ago
Group Membership and Wide-Area Master-Worker Computations
Group communications systems have been designed to provide an infrastructure for fault-tolerance in distributed systems, including wide-area systems. In our work on master-worker ...
Kjetil Jacobsen, Xianan Zhang, Keith Marzullo