Sciweavers

1074 search results - page 125 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
JCT
2010
112views more  JCT 2010»
14 years 8 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra
ATAL
2008
Springer
14 years 11 months ago
Automated design of scoring rules by learning from examples
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosensc...
JSAC
2008
139views more  JSAC 2008»
14 years 9 months ago
A Game-Theoretic Framework for Medium Access Control
In this paper, we generalize the random access game model, and show that it provides a general game-theoretic framework for designing contention based medium access control. We ext...
Tao Cui, Lijun Chen, Steven H. Low
TII
2008
169views more  TII 2008»
14 years 9 months ago
Fine-Tuning MAC-Level Protocols for Optimized Real-Time QoS
In distributed real-time systems, meeting the real-time constraints is mandatory but the satisfaction of other application-dependent criteria is most generally required as well. I...
Mathieu Grenier, Nicolas Navet
ICDM
2009
IEEE
107views Data Mining» more  ICDM 2009»
14 years 7 months ago
Naive Bayes Classification of Uncertain Data
Traditional machine learning algorithms assume that data are exact or precise. However, this assumption may not hold in some situations because of data uncertainty arising from mea...
Jiangtao Ren, Sau Dan Lee, Xianlu Chen, Ben Kao, R...