Sciweavers

2766 search results - page 522 / 554
» Algorithms for trigonometric polynomials
Sort
View
119
Voted
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
15 years 10 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, Madhu Sudan
ATAL
2009
Springer
15 years 10 months ago
Combinatorial prediction markets for event hierarchies
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
Mingyu Guo, David M. Pennock
DFG
2009
Springer
15 years 10 months ago
Interactive Communication, Diagnosis and Error Control in Networks
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
Rudolf Ahlswede, Harout K. Aydinian
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 10 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
150
Voted
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
15 years 10 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...