Searching for "Groupme!" – sorted by Relevance.
-
DigitalObjea IdealS9 (DOI) 10.1007/s00530-003-0076-5 Multime/s System (2003)
- Vide isincrexSTWWk the mere ofchoice for a varieP of communicationchanneca renneca primarily from incre8kw le vex ofneh orke multimeST systeme One way to keW ourheSw above the vide se is to provide summarie in a more tractable format. Manye xistingapproache are limite to e xploring important low-le
- Add To MetaCart
-
A near optimal algorithm for generating broadcast programs on multiple channels
- . By Lemma 2, t ( i+ 1: M ) M | Group j | 1 Data jk 2 ) M | Groupm| j= i+ 1 k = 1 f Datamn m= i+ 1 n= 1
- Cited by 8 (2 self) – Add To MetaCart
-
Analysing Parametrised Designs By Non-Standard Interpretation
- representation, Cv , in our language: Cv = snd InSkew ; rdl (CvCells ; D k D) ; �� 1 ; InSkew = 4D ; GroupM ; 4
- Cited by 5 (3 self) – Add To MetaCart
-
Adaptive Algorithms for
- on an operational machine M (where g-name 2 group(M )) can execute a g-leave operation. To join a group g-name 62
- Add To MetaCart
-
Modules With Strange Decomposition Properties
- ] proved that for certain ringsA, among themVr+1(Z) and Z, there is a separable abelian groupM
- Cited by 1 (0 self) – Add To MetaCart
-
NuPRL’s class theory and its applications
- can extend this to a group structure, GroupM, as {op : M × M → M; op : M; inv : M → M}. Notice
- Cited by 13 (6 self) – Add To MetaCart
-
Caltech
- }. By adding a component, we can extend this to a group structure, GroupM , as {op : M * M ! M ; op : M ; inv
- Add To MetaCart
-
Adaptive Algorithms for PASO Systems
- . To leave a group g-name, a server residing on an operational machine M (where g-name 2 group(M)) can
- Cited by 1 (1 self) – Add To MetaCart
-
Eighth International Conference on Web Engineering Achieving Efficient Access to Large Integrated Sets of Semantic Data in Web Applications
- of the last Semantic Web Challenge15, we also recognize the steps described above. GroupMe! [2] is a Web 2
- Add To MetaCart
-
Utilizing Multiuser Diversity for Efficient Support of Quality of Service over a Fading Channel
- of the frame; schedule each of other group-m users k �= k ∗ m(t) with ζm fraction of the frame. Thus, the total
- Cited by 17 (6 self) – Add To MetaCart

