Sciweavers

6881 search results - page 224 / 1377
» Motivation
Sort
View
CORR
2011
Springer
205views Education» more  CORR 2011»
15 years 1 months ago
On the algebraic numbers computable by some generalized Ehrenfest urns
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
Marie Albenque, Lucas Gerin
COLING
2010
15 years 1 months ago
Towards Automatic Building of Document Keywords
Document keywords are associated to documents as summarized versions of the documents' content. Considering that the number of documents is quickly growing every day, the ava...
Joaquim Silva, José Gabriel Lopes
RSA
2011
77views more  RSA 2011»
15 years 1 months ago
Regular induced subgraphs of a random Graph
An old problem of Erd˝os, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem...
Michael Krivelevich, Benny Sudakov, Nicholas C. Wo...
TCOM
2011
85views more  TCOM 2011»
15 years 1 months ago
Exploiting Sparse User Activity in Multiuser Detection
—The number of active users in code-division multiple access (CDMA) systems is often much lower than the spreading gain. The present paper exploits fruitfully this a priori infor...
Hao Zhu, Georgios B. Giannakis
TIT
2011
125views more  TIT 2011»
15 years 1 months ago
Exact-Repair MDS Code Construction Using Interference Alignment
Abstract—The high repair cost of (n;k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of MDS codes, called Repair MDS codes, that can signific...
Changho Suh, Kannan Ramchandran