Sciweavers

36
Voted
ICL
2016
39views more  ICL 2016»
9 years 12 months ago
BER Upper Bound Expressions in Coded Two-Transmission Schemes With Arbitrarily Spaced Signal Constellations
—The main contribution of this letter is the derivation of an upper bound BER expression, as a function of distances between signal points, for arbitrary constellations, in a gen...
Mehmet Cagri Ilter, Halim Yanikomeroglu, Pawel A. ...
30
Voted
ICL
2016
63views more  ICL 2016»
9 years 12 months ago
On the Capacity and Performance of Generalized Spatial Modulation
Abstract—Generalized spatial modulation (GSM) uses N antenna elements but fewer radio frequency (RF) chains (R) at the transmitter. In GSM, apart from conveying information bits ...
T. Lakshmi Narasimhan, A. Chockalingam
ICL
2016
42views more  ICL 2016»
9 years 12 months ago
Hierarchical Pairwise Error Probability for Hierarchical Decode and Forward Strategy in PLNC
—Pairwise error probability (PEP) is an essential tool allowing to design practical optimized coding schemes. It reveals the connection between the performance and the decoding m...
Jan Sykora
35
Voted
ICL
2016
57views more  ICL 2016»
9 years 12 months ago
Joint Consolidation and Service-Aware Load Balancing for Datacenters
—Workload consolidation is an efficient approach to reduce the power consumption of datacenters, meanwhile load balancing can reduce the datacenter’s user delay. Despite compl...
Chuan Pham, Nguyen H. Tran, Cuong T. Do, Eui-Nam H...
31
Voted
ICL
2016
48views more  ICL 2016»
9 years 12 months ago
Coexistence of Wi-Fi and Cellular With Listen-Before-Talk in Unlicensed Spectrum
Abstract—In this letter, we analyze the coexistence performance of Wi-Fi and cellular networks with different ListenBefore-Talk (LBT) procedures in the unlicensed spectrum. For t...
Yujae Song, Ki Won Sung, Youngnam Han
108
Voted
ICDT
2016
ACM
66views Database» more  ICDT 2016»
9 years 12 months ago
Worst-Case Optimal Algorithms for Parallel Query Processing
In this paper, we study the communication complexity for the problem of computing a conjunctive query on a large database in a parallel setting with p servers. In contrast to prev...
Paraschos Koutris, Paul Beame, Dan Suciu
107
Voted
ICDT
2016
ACM
56views Database» more  ICDT 2016»
9 years 12 months ago
Declarative Probabilistic Programming with Datalog
Probabilistic programming languages are used for developing statistical models, and they typically consist of two components: a specification of a stochastic process (the prior),...
Vince Bárány, Balder ten Cate, Benny...
113
Voted
ICDT
2016
ACM
48views Database» more  ICDT 2016»
9 years 12 months ago
Filtering With the Crowd: CrowdScreen Revisited
Filtering a set of items, based on a set of properties that can be verified by humans, is a common application of CrowdSourcing. When the workers are error-prone, each item is pr...
Benoît Groz, Ezra Levin, Isaac Meilijson, To...
203
Voted
ICDT
2016
ACM
68views Database» more  ICDT 2016»
9 years 12 months ago
Document Spanners: From Expressive Power to Decision Problems
We examine document spanners, a formal framework for information extraction that was introduced by Fagin et al. (PODS 2013). A document spanner is a function that maps an input st...
Dominik D. Freydenberger, Mario Holldack
110
Voted
ICDT
2016
ACM
44views Database» more  ICDT 2016»
9 years 12 months ago
On the Complexity of Enumerating the Answers to Well-designed Pattern Trees
Well-designed pattern trees (wdPTs) have been introduced as an extension of conjunctive queries to allow for partial matching – analogously to the OPTIONAL operator of the seman...
Markus Kröll, Reinhard Pichler, Sebastian Skr...