corpus_id stringlengths 7 12 | paper_id stringlengths 9 16 | title stringlengths 1 261 | abstract stringlengths 70 4.02k | source stringclasses 1
value | bibtex stringlengths 208 20.9k | citation_key stringlengths 6 100 |
|---|---|---|---|---|---|---|
arxiv-101 | 0704.2452 | Optimum Linear LLR Calculation for Iterative Decoding on Fading Channels | <|reference_start|>Optimum Linear LLR Calculation for Iterative Decoding on Fading Channels: On a fading channel with no channel state information at the receiver, calculating true log-likelihood ratios (LLR) is complicated. Existing work assume that the power of the additive noise is known and use the expected value o... | arxiv | @article{yazdani2007optimum,
title={Optimum Linear LLR Calculation for Iterative Decoding on Fading Channels},
author={Raman Yazdani, Masoud Ardakani},
journal={arXiv preprint arXiv:0704.2452},
year={2007},
doi={10.1109/ISIT.2007.4557204},
archivePrefix={arXiv},
eprint={0704.2452},
prima... | yazdani2007optimum |
arxiv-102 | 0704.2475 | Physical Layer Network Coding | <|reference_start|>Physical Layer Network Coding: A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes simultaneously. Rather than a bles... | arxiv | @article{shengli2007physical,
title={Physical Layer Network Coding},
author={Zhang Shengli, Soung-Chang Liew, Patrick P.K. Lam},
journal={arXiv preprint arXiv:0704.2475},
year={2007},
archivePrefix={arXiv},
eprint={0704.2475},
primaryClass={cs.IT math.IT}
} | shengli2007physical |
arxiv-103 | 0704.2505 | Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity | <|reference_start|>Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity: "Extended Clifford algebras" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic a... | arxiv | @article{rajan2007algebraic,
title={Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity},
author={G. Susinder Rajan and B. Sundar Rajan},
journal={arXiv preprint arXiv:0704.2505},
year={2007},
doi={10.1109/ISIT.2007.4557437},
archivePrefix={arXiv},
eprint={0704.2505},
... | rajan2007algebraic |
arxiv-104 | 0704.2507 | STBCs from Representation of Extended Clifford Algebras | <|reference_start|>STBCs from Representation of Extended Clifford Algebras: A set of sufficient conditions to construct $\lambda$-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight (CUW) co... | arxiv | @article{rajan2007stbcs,
title={STBCs from Representation of Extended Clifford Algebras},
author={G. Susinder Rajan and B. Sundar Rajan},
journal={arXiv preprint arXiv:0704.2507},
year={2007},
doi={10.1109/ISIT.2007.4557141},
archivePrefix={arXiv},
eprint={0704.2507},
primaryClass={cs.IT... | rajan2007stbcs |
arxiv-105 | 0704.2509 | Signal Set Design for Full-Diversity Low-Decoding-Complexity Differential Scaled-Unitary STBCs | <|reference_start|>Signal Set Design for Full-Diversity Low-Decoding-Complexity Differential Scaled-Unitary STBCs: The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of $g$-group encodable and $g$-group ... | arxiv | @article{rajan2007signal,
title={Signal Set Design for Full-Diversity Low-Decoding-Complexity
Differential Scaled-Unitary STBCs},
author={G. Susinder Rajan and B. Sundar Rajan},
journal={arXiv preprint arXiv:0704.2509},
year={2007},
doi={10.1109/ISIT.2007.4557453},
archivePrefix={arXiv},
e... | rajan2007signal |
arxiv-106 | 0704.2511 | Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay Networks | <|reference_start|>Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay Networks: The differential encoding/decoding setup introduced by Kiran et al, Oggier et al and Jing et al for wireless relay networks that use codebooks consisting of unitary matrices is extended to allow codebooks consisting of ... | arxiv | @article{rajan2007noncoherent,
title={Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay
Networks},
author={G. Susinder Rajan and B. Sundar Rajan},
journal={arXiv preprint arXiv:0704.2511},
year={2007},
doi={10.1109/ISIT.2007.4557438},
archivePrefix={arXiv},
eprint={07... | rajan2007noncoherent |
arxiv-107 | 0704.2542 | Narratives within immersive technologies | <|reference_start|>Narratives within immersive technologies: The main goal of this project is to research technical advances in order to enhance the possibility to develop narratives within immersive mediated environments. An important part of the research is concerned with the question of how a script can be written, ... | arxiv | @article{llobera2007narratives,
title={Narratives within immersive technologies},
author={Joan Llobera},
journal={arXiv preprint arXiv:0704.2542},
year={2007},
archivePrefix={arXiv},
eprint={0704.2542},
primaryClass={cs.HC}
} | llobera2007narratives |
arxiv-108 | 0704.2544 | Existence Proofs of Some EXIT Like Functions | <|reference_start|>Existence Proofs of Some EXIT Like Functions: The Extended BP (EBP) Generalized EXIT (GEXIT) function introduced in \cite{MMRU05} plays a fundamental role in the asymptotic analysis of sparse graph codes. For transmission over the binary erasure channel (BEC) the analytic properties of the EBP GEXIT ... | arxiv | @article{rathi2007existence,
title={Existence Proofs of Some EXIT Like Functions},
author={Vishwambhar Rathi, Ruediger Urbanke},
journal={arXiv preprint arXiv:0704.2544},
year={2007},
archivePrefix={arXiv},
eprint={0704.2544},
primaryClass={cs.IT math.IT}
} | rathi2007existence |
arxiv-109 | 0704.2596 | Computing Extensions of Linear Codes | <|reference_start|>Computing Extensions of Linear Codes: This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the previously known lower bound... | arxiv | @article{grassl2007computing,
title={Computing Extensions of Linear Codes},
author={Markus Grassl},
journal={Proceedings 2007 IEEE International Symposium on Information
Theory (ISIT 2007), Nice, France, June 2007, pp. 476-480},
year={2007},
doi={10.1109/ISIT.2007.4557095},
archivePrefix={arXi... | grassl2007computing |
arxiv-110 | 0704.2609 | A-infinity structure on simplicial complexes | <|reference_start|>A-infinity structure on simplicial complexes: A discrete (finite-difference) analogue of differential forms is considered, defined on simplicial complexes, including triangulations of continuous manifolds. Various operations are explicitly defined on these forms, including exterior derivative and ext... | arxiv | @article{dolotin2007a-infinity,
title={A-infinity structure on simplicial complexes},
author={V.Dolotin, A.Morozov and Sh.Shakirov},
journal={arXiv preprint arXiv:0704.2609},
year={2007},
doi={10.1007/s11232-008-0093-9},
number={ITEP/TH-13/07},
archivePrefix={arXiv},
eprint={0704.2609},
... | dolotin2007a-infinity |
arxiv-111 | 0704.2644 | Joint universal lossy coding and identification of stationary mixing sources | <|reference_start|>Joint universal lossy coding and identification of stationary mixing sources: The problem of joint universal source coding and modeling, treated in the context of lossless codes by Rissanen, was recently generalized to fixed-rate lossy coding of finitely parametrized continuous-alphabet i.i.d. source... | arxiv | @article{raginsky2007joint,
title={Joint universal lossy coding and identification of stationary mixing
sources},
author={Maxim Raginsky},
journal={arXiv preprint arXiv:0704.2644},
year={2007},
archivePrefix={arXiv},
eprint={0704.2644},
primaryClass={cs.IT cs.LG math.IT}
} | raginsky2007joint |
arxiv-112 | 0704.2651 | Opportunistic Communications in an Orthogonal Multiaccess Relay Channel | <|reference_start|>Opportunistic Communications in an Orthogonal Multiaccess Relay Channel: The problem of resource allocation is studied for a two-user fading orthogonal multiaccess relay channel (MARC) where both users (sources) communicate with a destination in the presence of a relay. A half-duplex relay is conside... | arxiv | @article{sankar2007opportunistic,
title={Opportunistic Communications in an Orthogonal Multiaccess Relay Channel},
author={Lalitha Sankar, Yingbin Liang, H. Vincent Poor, Narayan B. Mandayam},
journal={arXiv preprint arXiv:0704.2651},
year={2007},
doi={10.1109/ISIT.2007.4557396},
archivePrefix={... | sankar2007opportunistic |
arxiv-113 | 0704.2659 | Minimum Expected Distortion in Gaussian Layered Broadcast Coding with Successive Refinement | <|reference_start|>Minimum Expected Distortion in Gaussian Layered Broadcast Coding with Successive Refinement: A transmitter without channel state information (CSI) wishes to send a delay-limited Gaussian source over a slowly fading channel. The source is coded in superimposed layers, with each layer successively refi... | arxiv | @article{ng2007minimum,
title={Minimum Expected Distortion in Gaussian Layered Broadcast Coding with
Successive Refinement},
author={Chris T. K. Ng, Deniz Gunduz, Andrea J. Goldsmith, Elza Erkip},
journal={arXiv preprint arXiv:0704.2659},
year={2007},
doi={10.1109/ISIT.2007.4557165},
archivePr... | ng2007minimum |
arxiv-114 | 0704.2668 | Supervised Feature Selection via Dependence Estimation | <|reference_start|>Supervised Feature Selection via Dependence Estimation: We introduce a framework for filtering features that employs the Hilbert-Schmidt Independence Criterion (HSIC) as a measure of dependence between the features and the labels. The key idea is that good features should maximise such dependence. Fe... | arxiv | @article{song2007supervised,
title={Supervised Feature Selection via Dependence Estimation},
author={Le Song, Alex Smola, Arthur Gretton, Karsten Borgwardt, Justin Bedo},
journal={arXiv preprint arXiv:0704.2668},
year={2007},
archivePrefix={arXiv},
eprint={0704.2668},
primaryClass={cs.LG}
} | song2007supervised |
arxiv-115 | 0704.2680 | A Channel that Heats Up | <|reference_start|>A Channel that Heats Up: Motivated by on-chip communication, a channel model is proposed where the variance of the additive noise depends on the weighted sum of the past channel input powers. For this channel, an expression for the capacity per unit cost is derived, and it is shown that the expressio... | arxiv | @article{koch2007a,
title={A Channel that Heats Up},
author={Tobias Koch, Amos Lapidoth and Paul P. Sotiriadis},
journal={arXiv preprint arXiv:0704.2680},
year={2007},
archivePrefix={arXiv},
eprint={0704.2680},
primaryClass={cs.IT math.IT}
} | koch2007a |
arxiv-116 | 0704.2725 | Exploiting Heavy Tails in Training Times of Multilayer Perceptrons: A Case Study with the UCI Thyroid Disease Database | <|reference_start|>Exploiting Heavy Tails in Training Times of Multilayer Perceptrons: A Case Study with the UCI Thyroid Disease Database: The random initialization of weights of a multilayer perceptron makes it possible to model its training process as a Las Vegas algorithm, i.e. a randomized algorithm which stops whe... | arxiv | @article{cebrian2007exploiting,
title={Exploiting Heavy Tails in Training Times of Multilayer Perceptrons: A
Case Study with the UCI Thyroid Disease Database},
author={Manuel Cebrian and Ivan Cantador},
journal={arXiv preprint arXiv:0704.2725},
year={2007},
archivePrefix={arXiv},
eprint={0704.... | cebrian2007exploiting |
arxiv-117 | 0704.2778 | Random Access Broadcast: Stability and Throughput Analysis | <|reference_start|>Random Access Broadcast: Stability and Throughput Analysis: A wireless network in which packets are broadcast to a group of receivers through use of a random access protocol is considered in this work. The relation to previous work on networks of interacting queues is discussed and subsequently, the ... | arxiv | @article{shrader2007random,
title={Random Access Broadcast: Stability and Throughput Analysis},
author={Brooke Shrader and Anthony Ephremides},
journal={IEEE Transactions on Information Theory, vol. 53, no. 8, pp.
2915-2921, August 2007.},
year={2007},
archivePrefix={arXiv},
eprint={0704.2778}... | shrader2007random |
arxiv-118 | 0704.2779 | The Complexity of Simple Stochastic Games | <|reference_start|>The Complexity of Simple Stochastic Games: In this paper we survey the computational time complexity of assorted simple stochastic game problems, and we give an overview of the best known algorithms associated with each problem.<|reference_end|> | arxiv | @article{dieckelmann2007the,
title={The Complexity of Simple Stochastic Games},
author={Jonas Dieckelmann},
journal={arXiv preprint arXiv:0704.2779},
year={2007},
archivePrefix={arXiv},
eprint={0704.2779},
primaryClass={cs.CC cs.GT}
} | dieckelmann2007the |
arxiv-119 | 0704.2786 | Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels | <|reference_start|>Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels: This paper studies a variant of the classical problem of ``writing on dirty paper'' in which the sum of the input and the interference, or dirt, is multiplied by a random variable that models resizing,... | arxiv | @article{zhang2007writing,
title={Writing on Dirty Paper with Resizing and its Application to Quasi-Static
Fading Broadcast Channels},
author={Wenyi Zhang, Shivaprasad Kotagiri, and J. Nicholas Laneman},
journal={arXiv preprint arXiv:0704.2786},
year={2007},
doi={10.1109/ISIT.2007.4557255},
ar... | zhang2007writing |
arxiv-120 | 0704.2808 | Minimum cost distributed source coding over a network | <|reference_start|>Minimum cost distributed source coding over a network: This work considers the problem of transmitting multiple compressible sources over a network at minimum cost. The aim is to find the optimal rates at which the sources should be compressed and the network flows using which they should be transmit... | arxiv | @article{ramamoorthy2007minimum,
title={Minimum cost distributed source coding over a network},
author={Aditya Ramamoorthy},
journal={arXiv preprint arXiv:0704.2808},
year={2007},
archivePrefix={arXiv},
eprint={0704.2808},
primaryClass={cs.IT cs.NI math.IT}
} | ramamoorthy2007minimum |
arxiv-121 | 0704.2811 | On Algebraic Decoding of $q$-ary Reed-Muller and Product-Reed-Solomon Codes | <|reference_start|>On Algebraic Decoding of $q$-ary Reed-Muller and Product-Reed-Solomon Codes: We consider a list decoding algorithm recently proposed by Pellikaan-Wu \cite{PW2005} for $q$-ary Reed-Muller codes $\mathcal{RM}_q(\ell, m, n)$ of length $n \leq q^m$ when $\ell \leq q$. A simple and easily accessible corre... | arxiv | @article{santhi2007on,
title={On Algebraic Decoding of $q$-ary Reed-Muller and Product-Reed-Solomon
Codes},
author={Nandakishore Santhi},
journal={arXiv preprint arXiv:0704.2811},
year={2007},
doi={10.1109/ISIT.2007.4557130},
number={LA-UR-07-0469},
archivePrefix={arXiv},
eprint={0704.... | santhi2007on |
arxiv-122 | 0704.2841 | A High-Throughput Cross-Layer Scheme for Distributed Wireless Ad Hoc Networks | <|reference_start|>A High-Throughput Cross-Layer Scheme for Distributed Wireless Ad Hoc Networks: In wireless ad hoc networks, distributed nodes can collaboratively form an antenna array for long-distance communications to achieve high energy efficiency. In recent work, Ochiai, et al., have shown that such collaborativ... | arxiv | @article{petropulu2007a,
title={A High-Throughput Cross-Layer Scheme for Distributed Wireless Ad Hoc
Networks},
author={Athina P. Petropulu, Lun Dong, H. Vincent Poor},
journal={arXiv preprint arXiv:0704.2841},
year={2007},
archivePrefix={arXiv},
eprint={0704.2841},
primaryClass={cs.IT mat... | petropulu2007a |
arxiv-123 | 0704.2852 | Nature-Inspired Interconnects for Self-Assembled Large-Scale Network-on-Chip Designs | <|reference_start|>Nature-Inspired Interconnects for Self-Assembled Large-Scale Network-on-Chip Designs: Future nano-scale electronics built up from an Avogadro number of components needs efficient, highly scalable, and robust means of communication in order to be competitive with traditional silicon approaches. In rec... | arxiv | @article{teuscher2007nature-inspired,
title={Nature-Inspired Interconnects for Self-Assembled Large-Scale
Network-on-Chip Designs},
author={Christof Teuscher},
journal={Chaos, 17(2):026106, 2007},
year={2007},
doi={10.1063/1.2740566},
number={LA-UR-07-0204},
archivePrefix={arXiv},
epri... | teuscher2007nature-inspired |
arxiv-124 | 0704.2857 | Modern Coding Theory: The Statistical Mechanics and Computer Science Point of View | <|reference_start|>Modern Coding Theory: The Statistical Mechanics and Computer Science Point of View: These are the notes for a set of lectures delivered by the two authors at the Les Houches Summer School on `Complex Systems' in July 2006. They provide an introduction to the basic concepts in modern (probabilistic) c... | arxiv | @article{montanari2007modern,
title={Modern Coding Theory: The Statistical Mechanics and Computer Science
Point of View},
author={Andrea Montanari and Rudiger Urbanke},
journal={arXiv preprint arXiv:0704.2857},
year={2007},
archivePrefix={arXiv},
eprint={0704.2857},
primaryClass={cs.IT con... | montanari2007modern |
arxiv-125 | 0704.2900 | Higher-order theories | <|reference_start|>Higher-order theories: We extend our approach to abstract syntax (with binding constructions) through modules and linearity. First we give a new general definition of arity, yielding the companion notion of signature. Then we obtain a modularity result as requested by Ghani and Uustalu (2003): in our... | arxiv | @article{hirschowitz2007higher-order,
title={Higher-order theories},
author={Andre' Hirschowitz and Marco Maggesi},
journal={arXiv preprint arXiv:0704.2900},
year={2007},
archivePrefix={arXiv},
eprint={0704.2900},
primaryClass={cs.LO}
} | hirschowitz2007higher-order |
arxiv-126 | 0704.2902 | Recommending Related Papers Based on Digital Library Access Records | <|reference_start|>Recommending Related Papers Based on Digital Library Access Records: An important goal for digital libraries is to enable researchers to more easily explore related work. While citation data is often used as an indicator of relatedness, in this paper we demonstrate that digital access records (e.g. h... | arxiv | @article{pohl2007recommending,
title={Recommending Related Papers Based on Digital Library Access Records},
author={Stefan Pohl, Filip Radlinski and Thorsten Joachims},
journal={arXiv preprint arXiv:0704.2902},
year={2007},
archivePrefix={arXiv},
eprint={0704.2902},
primaryClass={cs.DL cs.IR... | pohl2007recommending |
arxiv-127 | 0704.2919 | On Verifying and Engineering the Well-gradedness of a Union-closed Family | <|reference_start|>On Verifying and Engineering the Well-gradedness of a Union-closed Family: Current techniques for generating a knowledge space, such as QUERY, guarantees that the resulting structure is closed under union, but not that it satisfies wellgradedness, which is one of the defining conditions for a learnin... | arxiv | @article{eppstein2007on,
title={On Verifying and Engineering the Well-gradedness of a Union-closed
Family},
author={David Eppstein, Jean-Claude Falmagne, and Hasan Uzun},
journal={J. Mathematical Psychology 53(1):34-39, 2009},
year={2007},
doi={10.1016/j.jmp.2008.09.002},
archivePrefix={arXiv}... | eppstein2007on |
arxiv-128 | 0704.2926 | Optimal Routing for the Gaussian Multiple-Relay Channel with Decode-and-Forward | <|reference_start|>Optimal Routing for the Gaussian Multiple-Relay Channel with Decode-and-Forward: In this paper, we study a routing problem on the Gaussian multiple relay channel, in which nodes employ a decode-and-forward coding strategy. We are interested in routes for the information flow through the relays that a... | arxiv | @article{ong2007optimal,
title={Optimal Routing for the Gaussian Multiple-Relay Channel with
Decode-and-Forward},
author={Lawrence Ong, Mehul Motani},
journal={Proceedings of the 2007 IEEE International Symposium on
Information Theory (ISIT 2007), Acropolis Congress and Exhibition Center,
Nice, France... | ong2007optimal |
arxiv-129 | 0704.2963 | Using Access Data for Paper Recommendations on ArXivorg | <|reference_start|>Using Access Data for Paper Recommendations on ArXivorg: This thesis investigates in the use of access log data as a source of information for identifying related scientific papers. This is done for arXiv.org, the authority for publication of e-prints in several fields of physics. Compared to citat... | arxiv | @article{pohl2007using,
title={Using Access Data for Paper Recommendations on ArXiv.org},
author={Stefan Pohl},
journal={arXiv preprint arXiv:0704.2963},
year={2007},
archivePrefix={arXiv},
eprint={0704.2963},
primaryClass={cs.DL cs.IR}
} | pohl2007using |
arxiv-130 | 0704.3019 | Arbitrary Rate Permutation Modulation for the Gaussian Channel | <|reference_start|>Arbitrary Rate Permutation Modulation for the Gaussian Channel: In this paper non-group permutation modulated sequences for the Gaussian channel are considered. Without the restriction to group codes rather than subsets of group codes, arbitrary rates are achievable. The code construction utilizes th... | arxiv | @article{henkel2007arbitrary,
title={Arbitrary Rate Permutation Modulation for the Gaussian Channel},
author={Oliver Henkel},
journal={arXiv preprint arXiv:0704.3019},
year={2007},
archivePrefix={arXiv},
eprint={0704.3019},
primaryClass={cs.IT math.IT}
} | henkel2007arbitrary |
arxiv-131 | 0704.3035 | Achievable Rates for Two-Way Wire-Tap Channels | <|reference_start|>Achievable Rates for Two-Way Wire-Tap Channels: We consider two-way wire-tap channels, where two users are communicating with each other in the presence of an eavesdropper, who has access to the communications through a multiple-access channel. We find achievable rates for two different scenarios, th... | arxiv | @article{tekin2007achievable,
title={Achievable Rates for Two-Way Wire-Tap Channels},
author={Ender Tekin, Aylin Yener},
journal={arXiv preprint arXiv:0704.3035},
year={2007},
archivePrefix={arXiv},
eprint={0704.3035},
primaryClass={cs.IT cs.CR math.IT}
} | tekin2007achievable |
arxiv-132 | 0704.3094 | Detection of two-sided alternatives in a Brownian motion model | <|reference_start|>Detection of two-sided alternatives in a Brownian motion model: This work examines the problem of sequential detection of a change in the drift of a Brownian motion in the case of two-sided alternatives. Applications to real life situations in which two-sided changes can occur are discussed. Traditio... | arxiv | @article{hadjiliadis2007detection,
title={Detection of two-sided alternatives in a Brownian motion model},
author={Olympia Hadjiliadis and H.Vincent Poor},
journal={arXiv preprint arXiv:0704.3094},
year={2007},
archivePrefix={arXiv},
eprint={0704.3094},
primaryClass={cs.IT math.IT}
} | hadjiliadis2007detection |
arxiv-133 | 0704.3120 | Space Time Codes from Permutation Codes | <|reference_start|>Space Time Codes from Permutation Codes: A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and space time codes has be... | arxiv | @article{henkel2007space,
title={Space Time Codes from Permutation Codes},
author={Oliver Henkel},
journal={Proc. IEEE GlobeCom, San Francisco, California, Nov. 2006},
year={2007},
archivePrefix={arXiv},
eprint={0704.3120},
primaryClass={cs.IT math.IT}
} | henkel2007space |
arxiv-134 | 0704.3141 | Algorithm for Evaluation of the Interval Power Function of Unconstrained Arguments | <|reference_start|>Algorithm for Evaluation of the Interval Power Function of Unconstrained Arguments: We describe an algorithm for evaluation of the interval extension of the power function of variables x and y given by the expression x^y. Our algorithm reduces the general case to the case of non-negative bases.<|refe... | arxiv | @article{petrov2007algorithm,
title={Algorithm for Evaluation of the Interval Power Function of Unconstrained
Arguments},
author={Evgueni Petrov},
journal={arXiv preprint arXiv:0704.3141},
year={2007},
archivePrefix={arXiv},
eprint={0704.3141},
primaryClass={cs.MS}
} | petrov2007algorithm |
arxiv-135 | 0704.3157 | Experimenting with recursive queries in database and logic programming systems | <|reference_start|>Experimenting with recursive queries in database and logic programming systems: This paper considers the problem of reasoning on massive amounts of (possibly distributed) data. Presently, existing proposals show some limitations: {\em (i)} the quantity of data that can be handled contemporarily is li... | arxiv | @article{terracina2007experimenting,
title={Experimenting with recursive queries in database and logic programming
systems},
author={Giorgio Terracina, Nicola Leone, Vincenzino Lio, Claudio Panetta},
journal={arXiv preprint arXiv:0704.3157},
year={2007},
archivePrefix={arXiv},
eprint={0704.315... | terracina2007experimenting |
arxiv-136 | 0704.3177 | Computing modular polynomials in quasi-linear time | <|reference_start|>Computing modular polynomials in quasi-linear time: We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in the liter... | arxiv | @article{enge2007computing,
title={Computing modular polynomials in quasi-linear time},
author={Andreas Enge (INRIA Futurs)},
journal={Mathematics of Computation 78, 267 (2009) 1809-1824},
year={2007},
archivePrefix={arXiv},
eprint={0704.3177},
primaryClass={math.NT cs.CC}
} | enge2007computing |
arxiv-137 | 0704.3197 | Euclidean Shortest Paths in Simple Cube Curves at a Glance | <|reference_start|>Euclidean Shortest Paths in Simple Cube Curves at a Glance: This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary accuracy, defined by $\epsilon >0$, and in time complexity $\k... | arxiv | @article{li2007euclidean,
title={Euclidean Shortest Paths in Simple Cube Curves at a Glance},
author={Fajie Li and Reinhard Klette},
journal={arXiv preprint arXiv:0704.3197},
year={2007},
number={CITR-TR-198},
archivePrefix={arXiv},
eprint={0704.3197},
primaryClass={cs.CG cs.DM}
} | li2007euclidean |
arxiv-138 | 0704.3199 | Generalized Stability Condition for Generalized and Doubly-Generalized LDPC Codes | <|reference_start|>Generalized Stability Condition for Generalized and Doubly-Generalized LDPC Codes: In this paper, the stability condition for low-density parity-check (LDPC) codes on the binary erasure channel (BEC) is extended to generalized LDPC (GLDPC) codes and doublygeneralized LDPC (D-GLDPC) codes. It is prove... | arxiv | @article{paolini2007generalized,
title={Generalized Stability Condition for Generalized and Doubly-Generalized
LDPC Codes},
author={E. Paolini, M. Fossorier, M. Chiani},
journal={arXiv preprint arXiv:0704.3199},
year={2007},
doi={10.1109/ISIT.2007.4557440},
archivePrefix={arXiv},
eprint={0... | paolini2007generalized |
arxiv-139 | 0704.3228 | Characterization of P2P IPTV Traffic: Scaling Analysis | <|reference_start|>Characterization of P2P IPTV Traffic: Scaling Analysis: P2P IPTV applications arise on the Internet and will be massively used in the future. It is expected that P2P IPTV will contribute to increase the overall Internet traffic. In this context, it is important to measure the impact of P2P IPTV on th... | arxiv | @article{silverston2007characterization,
title={Characterization of P2P IPTV Traffic: Scaling Analysis},
author={Thomas Silverston, Olivier Fourmaux and Kave Salamatian},
journal={arXiv preprint arXiv:0704.3228},
year={2007},
archivePrefix={arXiv},
eprint={0704.3228},
primaryClass={cs.NI cs.... | silverston2007characterization |
arxiv-140 | 0704.3238 | Alternative axiomatics and complexity of deliberative STIT theories | <|reference_start|>Alternative axiomatics and complexity of deliberative STIT theories: We propose two alternatives to Xu's axiomatization of the Chellas STIT. The first one also provides an alternative axiomatization of the deliberative STIT. The second one starts from the idea that the historic necessity operator can... | arxiv | @article{balbiani2007alternative,
title={Alternative axiomatics and complexity of deliberative STIT theories},
author={Philippe Balbiani, Andreas Herzig and Nicolas Troquard},
journal={arXiv preprint arXiv:0704.3238},
year={2007},
doi={10.1007/s10992-007-9078-7},
archivePrefix={arXiv},
eprin... | balbiani2007alternative |
arxiv-141 | 0704.3241 | Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach | <|reference_start|>Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach: We examine the problem of determining which nodes are neighbors of a given one in a wireless network. We consider an unsupervised network operating on a frequency-flat Gaussian channel, where $K+1$ nodes associate their identitie... | arxiv | @article{angelosante2007neighbor,
title={Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach},
author={Daniele Angelosante, Ezio Biglieri, Marco Lops},
journal={arXiv preprint arXiv:0704.3241},
year={2007},
archivePrefix={arXiv},
eprint={0704.3241},
primaryClass={cs.IT mat... | angelosante2007neighbor |
arxiv-142 | 0704.3268 | 2D Path Solutions from a Single Layer Excitable CNN Model | <|reference_start|>2D Path Solutions from a Single Layer Excitable CNN Model: An easily implementable path solution algorithm for 2D spatial problems, based on excitable/programmable characteristics of a specific cellular nonlinear network (CNN) model is presented and numerically investigated. The network is a single l... | arxiv | @article{karahaliloglu20072d,
title={2D Path Solutions from a Single Layer Excitable CNN Model},
author={Koray Karahaliloglu},
journal={arXiv preprint arXiv:0704.3268},
year={2007},
archivePrefix={arXiv},
eprint={0704.3268},
primaryClass={cs.RO cs.NE}
} | karahaliloglu20072d |
arxiv-143 | 0704.3287 | Sample size cognizant detection of signals in white noise | <|reference_start|>Sample size cognizant detection of signals in white noise: The detection and estimation of signals in noisy, limited data is a problem of interest to many scientific and engineering communities. We present a computationally simple, sample eigenvalue based procedure for estimating the number of high-d... | arxiv | @article{rao2007sample,
title={Sample size cognizant detection of signals in white noise},
author={N. Raj Rao, Alan Edelman},
journal={arXiv preprint arXiv:0704.3287},
year={2007},
archivePrefix={arXiv},
eprint={0704.3287},
primaryClass={cs.IT math.IT}
} | rao2007sample |
arxiv-144 | 0704.3292 | Coalition Games with Cooperative Transmission: A Cure for the Curse of Boundary Nodes in Selfish Packet-Forwarding Wireless Networks | <|reference_start|>Coalition Games with Cooperative Transmission: A Cure for the Curse of Boundary Nodes in Selfish Packet-Forwarding Wireless Networks: In wireless packet-forwarding networks with selfish nodes, applications of a repeated game can induce the nodes to forward each others' packets, so that the network pe... | arxiv | @article{han2007coalition,
title={Coalition Games with Cooperative Transmission: A Cure for the Curse of
Boundary Nodes in Selfish Packet-Forwarding Wireless Networks},
author={Zhu Han and H. Vincent Poor},
journal={in the Proceedings of the 5th International Symposium on Modeling
and Optimization in Mo... | han2007coalition |
arxiv-145 | 0704.3313 | Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters | <|reference_start|>Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters: We introduce the straggler identification problem, in which an algorithm must determine the identities of the remaining members of a set after it has had a large number of insertion and deletion ... | arxiv | @article{eppstein2007straggler,
title={Straggler Identification in Round-Trip Data Streams via Newton's
Identities and Invertible Bloom Filters},
author={David Eppstein and Michael T. Goodrich},
journal={arXiv preprint arXiv:0704.3313},
year={2007},
archivePrefix={arXiv},
eprint={0704.3313},
... | eppstein2007straggler |
arxiv-146 | 0704.3316 | Vocabulary growth in collaborative tagging systems | <|reference_start|>Vocabulary growth in collaborative tagging systems: We analyze a large-scale snapshot of del.icio.us and investigate how the number of different tags in the system grows as a function of a suitably defined notion of time. We study the temporal evolution of the global vocabulary size, i.e. the number ... | arxiv | @article{cattuto2007vocabulary,
title={Vocabulary growth in collaborative tagging systems},
author={Ciro Cattuto, Andrea Baldassarri, Vito D. P. Servedio, Vittorio Loreto},
journal={arXiv preprint arXiv:0704.3316},
year={2007},
archivePrefix={arXiv},
eprint={0704.3316},
primaryClass={cs.IR c... | cattuto2007vocabulary |
arxiv-147 | 0704.3359 | Direct Optimization of Ranking Measures | <|reference_start|>Direct Optimization of Ranking Measures: Web page ranking and collaborative filtering require the optimization of sophisticated performance measures. Current Support Vector approaches are unable to optimize them directly and focus on pairwise comparisons instead. We present a new approach which allow... | arxiv | @article{le2007direct,
title={Direct Optimization of Ranking Measures},
author={Quoc Le and Alexander Smola},
journal={arXiv preprint arXiv:0704.3359},
year={2007},
archivePrefix={arXiv},
eprint={0704.3359},
primaryClass={cs.IR cs.AI}
} | le2007direct |
arxiv-148 | 0704.3391 | Lifetime Improvement in Wireless Sensor Networks via Collaborative Beamforming and Cooperative Transmission | <|reference_start|>Lifetime Improvement in Wireless Sensor Networks via Collaborative Beamforming and Cooperative Transmission: Collaborative beamforming (CB) and cooperative transmission (CT) have recently emerged as communication techniques that can make effective use of collaborative/cooperative nodes to create a vi... | arxiv | @article{han2007lifetime,
title={Lifetime Improvement in Wireless Sensor Networks via Collaborative
Beamforming and Cooperative Transmission},
author={Zhu Han and H. Vincent Poor},
journal={arXiv preprint arXiv:0704.3391},
year={2007},
archivePrefix={arXiv},
eprint={0704.3391},
primaryClas... | han2007lifetime |
arxiv-149 | 0704.3395 | General-Purpose Computing on a Semantic Network Substrate | <|reference_start|>General-Purpose Computing on a Semantic Network Substrate: This article presents a model of general-purpose computing on a semantic network substrate. The concepts presented are applicable to any semantic network representation. However, due to the standards and technological infrastructure devoted t... | arxiv | @article{rodriguez2007general-purpose,
title={General-Purpose Computing on a Semantic Network Substrate},
author={Marko A. Rodriguez},
journal={Emergent Web Intelligence: Advanced Semantic Technologies,
Advanced Information and Knowledge Processing series, Springer-Verlag, pages
57-104, ISBN:978-1-84996... | rodriguez2007general-purpose |
arxiv-150 | 0704.3396 | Lifetime Improvement of Wireless Sensor Networks by Collaborative Beamforming and Cooperative Transmission | <|reference_start|>Lifetime Improvement of Wireless Sensor Networks by Collaborative Beamforming and Cooperative Transmission: Extending network lifetime of battery-operated devices is a key design issue that allows uninterrupted information exchange among distributive nodes in wireless sensor networks. Collaborative b... | arxiv | @article{han2007lifetime,
title={Lifetime Improvement of Wireless Sensor Networks by Collaborative
Beamforming and Cooperative Transmission},
author={Zhu Han and H. Vincent Poor},
journal={arXiv preprint arXiv:0704.3396},
year={2007},
archivePrefix={arXiv},
eprint={0704.3396},
primaryClass... | han2007lifetime |
arxiv-151 | 0704.3399 | Cooperative Transmission Protocols with High Spectral Efficiency and High Diversity Order Using Multiuser Detection and Network Coding | <|reference_start|>Cooperative Transmission Protocols with High Spectral Efficiency and High Diversity Order Using Multiuser Detection and Network Coding: Cooperative transmission is an emerging communication technique that takes advantages of the broadcast nature of wireless channels. However, due to low spectral effi... | arxiv | @article{han2007cooperative,
title={Cooperative Transmission Protocols with High Spectral Efficiency and
High Diversity Order Using Multiuser Detection and Network Coding},
author={Zhu Han, Xin Zhang, and H. Vincent Poor},
journal={arXiv preprint arXiv:0704.3399},
year={2007},
doi={10.1109/ICC.200... | han2007cooperative |
arxiv-152 | 0704.3402 | Diversity-Multiplexing Tradeoff in Selective-Fading MIMO Channels | <|reference_start|>Diversity-Multiplexing Tradeoff in Selective-Fading MIMO Channels: We establish the optimal diversity-multiplexing (DM) tradeoff of coherent time, frequency and time-frequency selective-fading MIMO channels and provide a code design criterion for DM-tradeoff optimality. Our results are based on the a... | arxiv | @article{coronel2007diversity-multiplexing,
title={Diversity-Multiplexing Tradeoff in Selective-Fading MIMO Channels},
author={Pedro Coronel and Helmut B"olcskei},
journal={arXiv preprint arXiv:0704.3402},
year={2007},
archivePrefix={arXiv},
eprint={0704.3402},
primaryClass={cs.IT math.IT}
} | coronel2007diversity-multiplexing |
arxiv-153 | 0704.3405 | Estimation Diversity and Energy Efficiency in Distributed Sensing | <|reference_start|>Estimation Diversity and Energy Efficiency in Distributed Sensing: Distributed estimation based on measurements from multiple wireless sensors is investigated. It is assumed that a group of sensors observe the same quantity in independent additive observation noises with possibly different variances.... | arxiv | @article{cui2007estimation,
title={Estimation Diversity and Energy Efficiency in Distributed Sensing},
author={Shuguang Cui and Jinjun Xiao and Andrea Goldsmith and Zhi-Quan Luo and
H. Vincent Poor},
journal={arXiv preprint arXiv:0704.3405},
year={2007},
doi={10.1109/TSP.2007.896019},
archiveP... | cui2007estimation |
arxiv-154 | 0704.3408 | The Trade-off between Processing Gains of an Impulse Radio UWB System in the Presence of Timing Jitter | <|reference_start|>The Trade-off between Processing Gains of an Impulse Radio UWB System in the Presence of Timing Jitter: In time hopping impulse radio, $N_f$ pulses of duration $T_c$ are transmitted for each information symbol. This gives rise to two types of processing gain: (i) pulse combining gain, which is a fact... | arxiv | @article{gezici2007the,
title={The Trade-off between Processing Gains of an Impulse Radio UWB System in
the Presence of Timing Jitter},
author={Sinan Gezici, Andreas F. Molisch, H. Vincent Poor, and Hisashi
Kobayashi},
journal={arXiv preprint arXiv:0704.3408},
year={2007},
archivePrefix={arXiv},... | gezici2007the |
arxiv-155 | 0704.3433 | Bayesian approach to rough set | <|reference_start|>Bayesian approach to rough set: This paper proposes an approach to training rough set models using Bayesian framework trained using Markov Chain Monte Carlo (MCMC) method. The prior probabilities are constructed from the prior knowledge that good rough set models have fewer rules. Markov Chain Monte ... | arxiv | @article{marwala2007bayesian,
title={Bayesian approach to rough set},
author={Tshilidzi Marwala and Bodie Crossingham},
journal={arXiv preprint arXiv:0704.3433},
year={2007},
archivePrefix={arXiv},
eprint={0704.3433},
primaryClass={cs.AI}
} | marwala2007bayesian |
arxiv-156 | 0704.3434 | On sensing capacity of sensor networks for the class of linear observation, fixed SNR models | <|reference_start|>On sensing capacity of sensor networks for the class of linear observation, fixed SNR models: In this paper we address the problem of finding the sensing capacity of sensor networks for a class of linear observation models and a fixed SNR regime. Sensing capacity is defined as the maximum number of s... | arxiv | @article{aeron2007on,
title={On sensing capacity of sensor networks for the class of linear
observation, fixed SNR models},
author={Shuchin Aeron, Manqi Zhao and Venkatesh Saligrama},
journal={arXiv preprint arXiv:0704.3434},
year={2007},
archivePrefix={arXiv},
eprint={0704.3434},
primaryC... | aeron2007on |
arxiv-157 | 0704.3453 | An Adaptive Strategy for the Classification of G-Protein Coupled Receptors | <|reference_start|>An Adaptive Strategy for the Classification of G-Protein Coupled Receptors: One of the major problems in computational biology is the inability of existing classification models to incorporate expanding and new domain knowledge. This problem of static classification models is addressed in this paper ... | arxiv | @article{mohamed2007an,
title={An Adaptive Strategy for the Classification of G-Protein Coupled
Receptors},
author={S. Mohamed, D. Rubin, and T. Marwala},
journal={arXiv preprint arXiv:0704.3453},
year={2007},
archivePrefix={arXiv},
eprint={0704.3453},
primaryClass={cs.AI q-bio.QM}
} | mohamed2007an |
arxiv-158 | 0704.3496 | Polynomial algorithms for protein similarity search for restricted mRNA structures | <|reference_start|>Polynomial algorithms for protein similarity search for restricted mRNA structures: In this paper we consider the problem of computing an mRNA sequence of maximal similarity for a given mRNA of secondary structure constraints, introduced by Backofen et al. in [BNS02] denoted as the MRSO problem. The ... | arxiv | @article{gurski2007polynomial,
title={Polynomial algorithms for protein similarity search for restricted mRNA
structures},
author={Frank Gurski},
journal={arXiv preprint arXiv:0704.3496},
year={2007},
archivePrefix={arXiv},
eprint={0704.3496},
primaryClass={cs.DS cs.CC}
} | gurski2007polynomial |
arxiv-159 | 0704.3500 | Une plate-forme dynamique pour l'\'evaluation des performances des bases de donn\'ees \`a objets | <|reference_start|>Une plate-forme dynamique pour l'\'evaluation des performances des bases de donn\'ees \`a objets: In object-oriented or object-relational databases such as multimedia databases or most XML databases, access patterns are not static, i.e., applications do not always access the same objects in the same ... | arxiv | @article{he2007une,
title={Une plate-forme dynamique pour l'\'evaluation des performances des bases
de donn\'ees \`a objets},
author={Zhen He, J'er^ome Darmont (ERIC)},
journal={19\`emes Journ\'ees de Bases de Donn\'ees Avanc\'ees (BDA 03),
Lyon (20/10/2003) 423-442},
year={2007},
archivePrefix=... | he2007une |
arxiv-160 | 0704.3501 | Conception d'un banc d'essais d\'ecisionnel | <|reference_start|>Conception d'un banc d'essais d\'ecisionnel: We present in this paper a new benchmark for evaluating the performances of data warehouses. Benchmarking is useful either to system users for comparing the performances of different systems, or to system engineers for testing the effect of various design ... | arxiv | @article{darmont2007conception,
title={Conception d'un banc d'essais d\'ecisionnel},
author={J'er^ome Darmont (ERIC), Fadila Bentayeb (ERIC), Omar Boussa"id
(ERIC)},
journal={20\`emes Journ\'ees Bases de Donn\'ees Avanc\'ees (BDA 04),
Montpellier (19/10/2004) 493-511},
year={2007},
archivePrefix... | darmont2007conception |
arxiv-161 | 0704.3504 | Smooth R\'enyi Entropy of Ergodic Quantum Information Sources | <|reference_start|>Smooth R\'enyi Entropy of Ergodic Quantum Information Sources: We prove that the average smooth Renyi entropy rate will approach the entropy rate of a stationary, ergodic information source, which is equal to the Shannon entropy rate for a classical information source and the von Neumann entropy rate... | arxiv | @article{schoenmakers2007smooth,
title={Smooth R\'enyi Entropy of Ergodic Quantum Information Sources},
author={Berry Schoenmakers, Jilles Tjoelker, Pim Tuyls and Evgeny Verbitskiy},
journal={arXiv preprint arXiv:0704.3504},
year={2007},
archivePrefix={arXiv},
eprint={0704.3504},
primaryClas... | schoenmakers2007smooth |
arxiv-162 | 0704.3515 | Comparing Robustness of Pairwise and Multiclass Neural-Network Systems for Face Recognition | <|reference_start|>Comparing Robustness of Pairwise and Multiclass Neural-Network Systems for Face Recognition: Noise, corruptions and variations in face images can seriously hurt the performance of face recognition systems. To make such systems robust, multiclass neuralnetwork classifiers capable of learning from nois... | arxiv | @article{uglov2007comparing,
title={Comparing Robustness of Pairwise and Multiclass Neural-Network Systems
for Face Recognition},
author={J. Uglov, V. Schetinin, C. Maple},
journal={arXiv preprint arXiv:0704.3515},
year={2007},
doi={10.1155/2008/468693},
archivePrefix={arXiv},
eprint={0704... | uglov2007comparing |
arxiv-163 | 0704.3520 | Vers l'auto-administration des entrep\^ots de donn\'ees | <|reference_start|>Vers l'auto-administration des entrep\^ots de donn\'ees: With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The idea of using data mining techniques to extract useful knowledge f... | arxiv | @article{aouiche2007vers,
title={Vers l'auto-administration des entrep\^ots de donn\'ees},
author={Kamel Aouiche (ERIC), J'er^ome Darmont (ERIC)},
journal={XXXV\`emes Journ\'ees de Statistique, Session sp\'eciale
Entreposage et Fouille de Donn\'ees, Lyon (02/06/2003) 105-108},
year={2007},
archive... | aouiche2007vers |
arxiv-164 | 0704.3536 | $\delta$-sequences and Evaluation Codes defined by Plane Valuations at Infinity | <|reference_start|>$\delta$-sequences and Evaluation Codes defined by Plane Valuations at Infinity: We introduce the concept of $\delta$-sequence. A $\delta$-sequence $\Delta$ generates a well-ordered semigroup $S$ in $\mathbb{Z}^2$ or $\mathbb{R}$. We show how to construct (and compute parameters) for the dual code of... | arxiv | @article{galindo2007$\delta$-sequences,
title={$\delta$-sequences and Evaluation Codes defined by Plane Valuations at
Infinity},
author={C. Galindo and F.Monserrat},
journal={arXiv preprint arXiv:0704.3536},
year={2007},
archivePrefix={arXiv},
eprint={0704.3536},
primaryClass={cs.IT math.I... | galindo2007$\delta$-sequences |
arxiv-165 | 0704.3573 | Simulating spin systems on IANUS, an FPGA-based computer | <|reference_start|>Simulating spin systems on IANUS, an FPGA-based computer: We describe the hardwired implementation of algorithms for Monte Carlo simulations of a large class of spin models. We have implemented these algorithms as VHDL codes and we have mapped them onto a dedicated processor based on a large FPGA dev... | arxiv | @article{belletti2007simulating,
title={Simulating spin systems on IANUS, an FPGA-based computer},
author={F. Belletti, M. Cotallo, A. Cruz, L. A. Fern'andez, A. Gordillo, A.
Maiorano, F. Mantovani, E. Marinari, V. Mart'in-Mayor, A. Mu~noz-Sudupe, D.
Navarro, S. P'erez-Gaviro, J. J. Ruiz-Lorenzo, S. F. Schi... | belletti2007simulating |
arxiv-166 | 0704.3588 | On Energy Efficient Hierarchical Cross-Layer Design: Joint Power Control and Routing for Ad Hoc Networks | <|reference_start|>On Energy Efficient Hierarchical Cross-Layer Design: Joint Power Control and Routing for Ad Hoc Networks: In this paper, a hierarchical cross-layer design approach is proposed to increase energy efficiency in ad hoc networks through joint adaptation of nodes' transmitting powers and route selection. ... | arxiv | @article{comaniciu2007on,
title={On Energy Efficient Hierarchical Cross-Layer Design: Joint Power Control
and Routing for Ad Hoc Networks},
author={Cristina Comaniciu and H. Vincent Poor},
journal={arXiv preprint arXiv:0704.3588},
year={2007},
archivePrefix={arXiv},
eprint={0704.3588},
pri... | comaniciu2007on |
arxiv-167 | 0704.3591 | Capacity of a Class of Modulo-Sum Relay Channels | <|reference_start|>Capacity of a Class of Modulo-Sum Relay Channels: This paper characterizes the capacity of a class of modulo additive noise relay channels, in which the relay observes a corrupted version of the noise and has a separate channel to the destination. The capacity is shown to be strictly below the cut-se... | arxiv | @article{aleksic2007capacity,
title={Capacity of a Class of Modulo-Sum Relay Channels},
author={Marko Aleksic, Peyman Razaghi, Wei Yu},
journal={arXiv preprint arXiv:0704.3591},
year={2007},
archivePrefix={arXiv},
eprint={0704.3591},
primaryClass={cs.IT math.IT}
} | aleksic2007capacity |
arxiv-168 | 0704.3635 | Rough Sets Computations to Impute Missing Data | <|reference_start|>Rough Sets Computations to Impute Missing Data: Many techniques for handling missing data have been proposed in the literature. Most of these techniques are overly complex. This paper explores an imputation technique based on rough set computations. In this paper, characteristic relations are introdu... | arxiv | @article{nelwamondo2007rough,
title={Rough Sets Computations to Impute Missing Data},
author={Fulufhelo Vincent Nelwamondo and Tshilidzi Marwala},
journal={arXiv preprint arXiv:0704.3635},
year={2007},
archivePrefix={arXiv},
eprint={0704.3635},
primaryClass={cs.CV cs.IR}
} | nelwamondo2007rough |
arxiv-169 | 0704.3643 | Sabbath Day Home Automation: "It's Like Mixing Technology and Religion" | <|reference_start|>Sabbath Day Home Automation: "It's Like Mixing Technology and Religion": We present a qualitative study of 20 American Orthodox Jewish families' use of home automation for religious purposes. These lead users offer insight into real-life, long-term experience with home automation technologies. We dis... | arxiv | @article{woodruff2007sabbath,
title={Sabbath Day Home Automation: "It's Like Mixing Technology and Religion"},
author={Allison Woodruff, Sally Augustin, and Brooke Foucault},
journal={arXiv preprint arXiv:0704.3643},
year={2007},
archivePrefix={arXiv},
eprint={0704.3643},
primaryClass={cs.HC... | woodruff2007sabbath |
arxiv-170 | 0704.3644 | Capacity Gain from Two-Transmitter and Two-Receiver Cooperation | <|reference_start|>Capacity Gain from Two-Transmitter and Two-Receiver Cooperation: Capacity improvement from transmitter and receiver cooperation is investigated in a two-transmitter, two-receiver network with phase fading and full channel state information available at all terminals. The transmitters cooperate by fir... | arxiv | @article{ng2007capacity,
title={Capacity Gain from Two-Transmitter and Two-Receiver Cooperation},
author={Chris T. K. Ng, Nihar Jindal, Andrea J. Goldsmith, Urbashi Mitra},
journal={arXiv preprint arXiv:0704.3644},
year={2007},
doi={10.1109/TIT.2007.904987},
archivePrefix={arXiv},
eprint={07... | ng2007capacity |
arxiv-171 | 0704.3646 | Lower Bounds on Implementing Robust and Resilient Mediators | <|reference_start|>Lower Bounds on Implementing Robust and Resilient Mediators: We consider games that have (k,t)-robust equilibria when played with a mediator, where an equilibrium is (k,t)-robust if it tolerates deviations by coalitions of size up to k and deviations by up to $t$ players with unknown utilities. We pr... | arxiv | @article{abraham2007lower,
title={Lower Bounds on Implementing Robust and Resilient Mediators},
author={Ittai Abraham, Danny Dolev, and Joseph Y. Halpern},
journal={arXiv preprint arXiv:0704.3646},
year={2007},
archivePrefix={arXiv},
eprint={0704.3646},
primaryClass={cs.GT cs.CR cs.DC}
} | abraham2007lower |
arxiv-172 | 0704.3647 | Evaluating Personal Archiving Strategies for Internet-based Information | <|reference_start|>Evaluating Personal Archiving Strategies for Internet-based Information: Internet-based personal digital belongings present different vulnerabilities than locally stored materials. We use responses to a survey of people who have recovered lost websites, in combination with supplementary interviews, t... | arxiv | @article{marshall2007evaluating,
title={Evaluating Personal Archiving Strategies for Internet-based Information},
author={Catherine C. Marshall, Frank McCown, and Michael L. Nelson},
journal={arXiv preprint arXiv:0704.3647},
year={2007},
archivePrefix={arXiv},
eprint={0704.3647},
primaryClas... | marshall2007evaluating |
arxiv-173 | 0704.3653 | The Long Term Fate of Our Digital Belongings: Toward a Service Model for Personal Archives | <|reference_start|>The Long Term Fate of Our Digital Belongings: Toward a Service Model for Personal Archives: We conducted a preliminary field study to understand the current state of personal digital archiving in practice. Our aim is to design a service for the long-term storage, preservation, and access of digital b... | arxiv | @article{marshall2007the,
title={The Long Term Fate of Our Digital Belongings: Toward a Service Model for
Personal Archives},
author={Catherine C. Marshall, Sara Bly, and Francoise Brun-Cottan},
journal={arXiv preprint arXiv:0704.3653},
year={2007},
archivePrefix={arXiv},
eprint={0704.3653},
... | marshall2007the |
arxiv-174 | 0704.3662 | An Automated Evaluation Metric for Chinese Text Entry | <|reference_start|>An Automated Evaluation Metric for Chinese Text Entry: In this paper, we propose an automated evaluation metric for text entry. We also consider possible improvements to existing text entry evaluation metrics, such as the minimum string distance error rate, keystrokes per character, cost per correcti... | arxiv | @article{jiang2007an,
title={An Automated Evaluation Metric for Chinese Text Entry},
author={Mike Tian-Jian Jiang, James Zhan, Jaimie Lin, Jerry Lin, Wen-Lien Hsu},
journal={Jiang, Mike Tian-Jian, et al. "Robustness analysis of adaptive
chinese input methods." Advances in Text Input Methods (WTIM 2011) (2... | jiang2007an |
arxiv-175 | 0704.3665 | On the Development of Text Input Method - Lessons Learned | <|reference_start|>On the Development of Text Input Method - Lessons Learned: Intelligent Input Methods (IM) are essential for making text entries in many East Asian scripts, but their application to other languages has not been fully explored. This paper discusses how such tools can contribute to the development of co... | arxiv | @article{jiang2007on,
title={On the Development of Text Input Method - Lessons Learned},
author={Mike Tian-Jian Jiang, Deng Liu, Meng-Juei Hsieh, Wen-Lien Hsu},
journal={arXiv preprint arXiv:0704.3665},
year={2007},
archivePrefix={arXiv},
eprint={0704.3665},
primaryClass={cs.CL cs.HC}
} | jiang2007on |
arxiv-176 | 0704.3674 | Periodicity of certain piecewise affine planar maps | <|reference_start|>Periodicity of certain piecewise affine planar maps: We determine periodic and aperiodic points of certain piecewise affine maps in the Euclidean plane. Using these maps, we prove for $\lambda\in\{\frac{\pm1\pm\sqrt5}2,\pm\sqrt2,\pm\sqrt3\}$ that all integer sequences $(a_k)_{k\in\mathbb Z}$ satisfyi... | arxiv | @article{akiyama2007periodicity,
title={Periodicity of certain piecewise affine planar maps},
author={Shigeki Akiyama, Horst Brunotte, Attila Petho, Wolfgang Steiner
(LIAFA)},
journal={Tsukuba Journal of Mathematics 32, 1 (2008) 197-251},
year={2007},
archivePrefix={arXiv},
eprint={0704.3674},... | akiyama2007periodicity |
arxiv-177 | 0704.3683 | The Complexity of Weighted Boolean #CSP | <|reference_start|>The Complexity of Weighted Boolean #CSP: This paper gives a dichotomy theorem for the complexity of computing the partition function of an instance of a weighted Boolean constraint satisfaction problem. The problem is parameterised by a finite set F of non-negative functions that may be used to assig... | arxiv | @article{dyer2007the,
title={The Complexity of Weighted Boolean #CSP},
author={Martin Dyer, Leslie Ann Goldberg and Mark Jerrum},
journal={SIAM J. Comput. 38(5), 1970-1986},
year={2007},
doi={10.1137/070690201},
archivePrefix={arXiv},
eprint={0704.3683},
primaryClass={cs.CC math.CO}
} | dyer2007the |
arxiv-178 | 0704.3708 | Network statistics on early English Syntax: Structural criteria | <|reference_start|>Network statistics on early English Syntax: Structural criteria: This paper includes a reflection on the role of networks in the study of English language acquisition, as well as a collection of practical criteria to annotate free-speech corpora from children utterances. At the theoretical level, the... | arxiv | @article{corominas-murtra2007network,
title={Network statistics on early English Syntax: Structural criteria},
author={Bernat Corominas-Murtra},
journal={arXiv preprint arXiv:0704.3708},
year={2007},
archivePrefix={arXiv},
eprint={0704.3708},
primaryClass={cs.CL}
} | corominas-murtra2007network |
arxiv-179 | 0704.3746 | Distributed Algorithms for Spectrum Allocation, Power Control, Routing, and Congestion Control in Wireless Networks | <|reference_start|>Distributed Algorithms for Spectrum Allocation, Power Control, Routing, and Congestion Control in Wireless Networks: We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing total cost. In order to observe the fundamental duplexing constraint t... | arxiv | @article{xi2007distributed,
title={Distributed Algorithms for Spectrum Allocation, Power Control, Routing,
and Congestion Control in Wireless Networks},
author={Yufang Xi, Edmund M. Yeh},
journal={arXiv preprint arXiv:0704.3746},
year={2007},
doi={10.1145/1288107.1288132},
archivePrefix={arXiv... | xi2007distributed |
arxiv-180 | 0704.3773 | Avoiding Rotated Bitboards with Direct Lookup | <|reference_start|>Avoiding Rotated Bitboards with Direct Lookup: This paper describes an approach for obtaining direct access to the attacked squares of sliding pieces without resorting to rotated bitboards. The technique involves creating four hash tables using the built in hash arrays from an interpreted, high level... | arxiv | @article{tannous2007avoiding,
title={Avoiding Rotated Bitboards with Direct Lookup},
author={Sam Tannous},
journal={ICGA Journal, Vol. 30, No. 2, pp. 85-91. (June 2007).},
year={2007},
archivePrefix={arXiv},
eprint={0704.3773},
primaryClass={cs.DS}
} | tannous2007avoiding |
arxiv-181 | 0704.3780 | Stochastic Optimization Algorithms | <|reference_start|>Stochastic Optimization Algorithms: When looking for a solution, deterministic methods have the enormous advantage that they do find global optima. Unfortunately, they are very CPU-intensive, and are useless on untractable NP-hard problems that would require thousands of years for cutting-edge comput... | arxiv | @article{collet2007stochastic,
title={Stochastic Optimization Algorithms},
author={Pierre Collet, Jean-Philippe Rennard},
journal={Rennard, J.-P., Handbook of Research on Nature Inspired Computing
for Economics and Management, IGR, 2006},
year={2007},
archivePrefix={arXiv},
eprint={0704.3780},... | collet2007stochastic |
arxiv-182 | 0704.3835 | Minimizing Unsatisfaction in Colourful Neighbourhoods | <|reference_start|>Minimizing Unsatisfaction in Colourful Neighbourhoods: Colouring sparse graphs under various restrictions is a theoretical problem of significant practical relevance. Here we consider the problem of maximizing the number of different colours available at the nodes and their neighbourhoods, given a pr... | arxiv | @article{wong2007minimizing,
title={Minimizing Unsatisfaction in Colourful Neighbourhoods},
author={K. Y. Michael Wong and David Saad},
journal={J. Phys. A: Math. Theor. 41, 324023 (2008).},
year={2007},
doi={10.1088/1751-8113/41/32/324023},
archivePrefix={arXiv},
eprint={0704.3835},
pri... | wong2007minimizing |
arxiv-183 | 0704.3878 | A Game-Theoretic Approach to Energy-Efficient Modulation in CDMA Networks with Delay Constraints | <|reference_start|>A Game-Theoretic Approach to Energy-Efficient Modulation in CDMA Networks with Delay Constraints: A game-theoretic framework is used to study the effect of constellation size on the energy efficiency of wireless networks for M-QAM modulation. A non-cooperative game is proposed in which each user seek... | arxiv | @article{meshkati2007a,
title={A Game-Theoretic Approach to Energy-Efficient Modulation in CDMA
Networks with Delay Constraints},
author={Farhad Meshkati, Andrea J. Goldsmith, H. Vincent Poor and Stuart C.
Schwartz},
journal={arXiv preprint arXiv:0704.3878},
year={2007},
doi={10.1109/RWS.2007.35... | meshkati2007a |
arxiv-184 | 0704.3880 | Energy-Efficient Resource Allocation in Wireless Networks with Quality-of-Service Constraints | <|reference_start|>Energy-Efficient Resource Allocation in Wireless Networks with Quality-of-Service Constraints: A game-theoretic model is proposed to study the cross-layer problem of joint power and rate control with quality of service (QoS) constraints in multiple-access networks. In the proposed game, each user see... | arxiv | @article{meshkati2007energy-efficient,
title={Energy-Efficient Resource Allocation in Wireless Networks with
Quality-of-Service Constraints},
author={Farhad Meshkati, H. Vincent Poor, Stuart C. Schwartz and Radu V. Balan},
journal={arXiv preprint arXiv:0704.3880},
year={2007},
doi={10.1109/TCOMM.2... | meshkati2007energy-efficient |
arxiv-185 | 0704.3881 | A Unified Approach to Energy-Efficient Power Control in Large CDMA Systems | <|reference_start|>A Unified Approach to Energy-Efficient Power Control in Large CDMA Systems: A unified approach to energy-efficient power control is proposed for code-division multiple access (CDMA) networks. The approach is applicable to a large family of multiuser receivers including the matched filter, the decorre... | arxiv | @article{meshkati2007a,
title={A Unified Approach to Energy-Efficient Power Control in Large CDMA
Systems},
author={Farhad Meshkati, Dongning Guo, H. Vincent Poor and Stuart C. Schwartz},
journal={arXiv preprint arXiv:0704.3881},
year={2007},
archivePrefix={arXiv},
eprint={0704.3881},
prim... | meshkati2007a |
arxiv-186 | 0704.3886 | A Note on Ontology and Ordinary Language | <|reference_start|>A Note on Ontology and Ordinary Language: We argue for a compositional semantics grounded in a strongly typed ontology that reflects our commonsense view of the world and the way we talk about it. Assuming such a structure we show that the semantics of various natural language phenomena may become ne... | arxiv | @article{saba2007a,
title={A Note on Ontology and Ordinary Language},
author={Walid S. Saba},
journal={arXiv preprint arXiv:0704.3886},
year={2007},
archivePrefix={arXiv},
eprint={0704.3886},
primaryClass={cs.AI cs.CL}
} | saba2007a |
arxiv-187 | 0704.3890 | An algorithm for clock synchronization with the gradient property in sensor networks | <|reference_start|>An algorithm for clock synchronization with the gradient property in sensor networks: We introduce a distributed algorithm for clock synchronization in sensor networks. Our algorithm assumes that nodes in the network only know their immediate neighborhoods and an upper bound on the network's diameter... | arxiv | @article{pussente2007an,
title={An algorithm for clock synchronization with the gradient property in
sensor networks},
author={Rodolfo M. Pussente, Valmir C. Barbosa},
journal={Journal of Parallel and Distributed Computing 69 (2009), 261-265},
year={2007},
doi={10.1016/j.jpdc.2008.11.001},
arc... | pussente2007an |
arxiv-188 | 0704.3904 | Acyclic Preference Systems in P2P Networks | <|reference_start|>Acyclic Preference Systems in P2P Networks: In this work we study preference systems natural for the Peer-to-Peer paradigm. Most of them fall in three categories: global, symmetric and complementary. All these systems share an acyclicity property. As a consequence, they admit a stable (or Pareto effi... | arxiv | @article{gai2007acyclic,
title={Acyclic Preference Systems in P2P Networks},
author={Anh-Tuan Gai (INRIA Rocquencourt), Dmitry Lebedev (FT R&D), Fabien
Mathieu (FT R&D), Fabien De Montgolfier (LIAFA), Julien Reynier (LIENS),
Laurent Viennot (INRIA Rocquencourt)},
journal={arXiv preprint arXiv:0704.3904}... | gai2007acyclic |
arxiv-189 | 0704.3905 | Ensemble Learning for Free with Evolutionary Algorithms ? | <|reference_start|>Ensemble Learning for Free with Evolutionary Algorithms ?: Evolutionary Learning proceeds by evolving a population of classifiers, from which it generally returns (with some notable exceptions) the single best-of-run classifier as final result. In the meanwhile, Ensemble Learning, one of the most eff... | arxiv | @article{gagné2007ensemble,
title={Ensemble Learning for Free with Evolutionary Algorithms ?},
author={Christian Gagn'e (INFORMATIQUE WGZ INC.), Mich`ele Sebag (INRIA
Futurs), Marc Schoenauer (INRIA Futurs), Marco Tomassini (ISI)},
journal={Dans GECCO (2007)},
year={2007},
archivePrefix={arXiv},
... | gagné2007ensemble |
arxiv-190 | 0704.3931 | The Complexity of Model Checking Higher-Order Fixpoint Logic | <|reference_start|>The Complexity of Model Checking Higher-Order Fixpoint Logic: Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \lambda-calculus and the modal \lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of... | arxiv | @article{axelsson2007the,
title={The Complexity of Model Checking Higher-Order Fixpoint Logic},
author={Roland Axelsson, Martin Lange, and Rafal Somla},
journal={Logical Methods in Computer Science, Volume 3, Issue 2 (June 29,
2007) lmcs:754},
year={2007},
doi={10.2168/LMCS-3(2:7)2007},
archiv... | axelsson2007the |
arxiv-191 | 0704.3969 | Diversity of MIMO Multihop Relay Channels - Part I: Amplify-and-Forward | <|reference_start|>Diversity of MIMO Multihop Relay Channels - Part I: Amplify-and-Forward: In this two-part paper, we consider the multiantenna multihop relay channels in which the source signal arrives at the destination through N independent relaying hops in series. The main concern of this work is to design relayin... | arxiv | @article{yang2007diversity,
title={Diversity of MIMO Multihop Relay Channels - Part I: Amplify-and-Forward},
author={Sheng Yang and Jean-Claude Belfiore},
journal={arXiv preprint arXiv:0704.3969},
year={2007},
archivePrefix={arXiv},
eprint={0704.3969},
primaryClass={cs.IT math.IT}
} | yang2007diversity |
arxiv-192 | 0705.0010 | Critical phenomena in complex networks | <|reference_start|>Critical phenomena in complex networks: The combination of the compactness of networks, featuring small diameters, and their complex architectures results in a variety of critical effects dramatically different from those in cooperative systems on lattices. In the last few years, researchers have mad... | arxiv | @article{dorogovtsev2007critical,
title={Critical phenomena in complex networks},
author={S. N. Dorogovtsev, A. V. Goltsev, J. F. F. Mendes},
journal={Rev. Mod. Phys. 80, 1275 (2008)},
year={2007},
doi={10.1103/RevModPhys.80.1275},
archivePrefix={arXiv},
eprint={0705.0010},
primaryClass=... | dorogovtsev2007critical |
arxiv-193 | 0705.0017 | Checking Equivalence of Quantum Circuits and States | <|reference_start|>Checking Equivalence of Quantum Circuits and States: Quantum computing promises exponential speed-ups for important simulation and optimization problems. It also poses new CAD problems that are similar to, but more challenging, than the related problems in classical (non-quantum) CAD, such as determi... | arxiv | @article{viamontes2007checking,
title={Checking Equivalence of Quantum Circuits and States},
author={George F. Viamontes, Igor L. Markov, John P. Hayes},
journal={Proc. Int'l Conf. on Computer-Aided Design (ICCAD), pp. 69-74, San
Jose, CA, November 2007.},
year={2007},
archivePrefix={arXiv},
e... | viamontes2007checking |
arxiv-194 | 0705.0025 | Can the Internet cope with stress? | <|reference_start|>Can the Internet cope with stress?: When will the Internet become aware of itself? In this note the problem is approached by asking an alternative question: Can the Internet cope with stress? By extrapolating the psychological difference between coping and defense mechanisms a distributed software ex... | arxiv | @article{lisewski2007can,
title={Can the Internet cope with stress?},
author={Andreas Martin Lisewski},
journal={arXiv preprint arXiv:0705.0025},
year={2007},
archivePrefix={arXiv},
eprint={0705.0025},
primaryClass={cs.HC cs.AI}
} | lisewski2007can |
arxiv-195 | 0705.0043 | Joint Detection and Identification of an Unobservable Change in the Distribution of a Random Sequence | <|reference_start|>Joint Detection and Identification of an Unobservable Change in the Distribution of a Random Sequence: This paper examines the joint problem of detection and identification of a sudden and unobservable change in the probability distribution function (pdf) of a sequence of independent and identically ... | arxiv | @article{dayanik2007joint,
title={Joint Detection and Identification of an Unobservable Change in the
Distribution of a Random Sequence},
author={Savas Dayanik, Christian Goulding, H. Vincent Poor},
journal={arXiv preprint arXiv:0705.0043},
year={2007},
archivePrefix={arXiv},
eprint={0705.0043... | dayanik2007joint |
arxiv-196 | 0705.0044 | Reliable Memories Built from Unreliable Components Based on Expander Graphs | <|reference_start|>Reliable Memories Built from Unreliable Components Based on Expander Graphs: In this paper, memories built from components subject to transient faults are considered. A fault-tolerant memory architecture based on low-density parity-check codes is proposed and the existence of reliable memories for th... | arxiv | @article{chilappagari2007reliable,
title={Reliable Memories Built from Unreliable Components Based on Expander
Graphs},
author={Shashi Kiran Chilappagari and Bane Vasic},
journal={arXiv preprint arXiv:0705.0044},
year={2007},
archivePrefix={arXiv},
eprint={0705.0044},
primaryClass={cs.IT m... | chilappagari2007reliable |
arxiv-197 | 0705.0081 | Constructions of q-Ary Constant-Weight Codes | <|reference_start|>Constructions of q-Ary Constant-Weight Codes: This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between q-ary constant-weight codes and se... | arxiv | @article{chee2007constructions,
title={Constructions of q-Ary Constant-Weight Codes},
author={Yeow Meng Chee, San Ling},
journal={IEEE Transactions on Information Theory, Vol. 53, No. 1, January
2007, pp. 135-146},
year={2007},
doi={10.1109/TIT.2006.887499},
archivePrefix={arXiv},
eprint={... | chee2007constructions |
arxiv-198 | 0705.0085 | An efficient centralized binary multicast network coding algorithm for any cyclic network | <|reference_start|>An efficient centralized binary multicast network coding algorithm for any cyclic network: We give an algorithm for finding network encoding and decoding equations for error-free multicasting networks with multiple sources and sinks. The algorithm given is efficient (polynomial complexity) and works ... | arxiv | @article{diez2007an,
title={An efficient centralized binary multicast network coding algorithm for
any cyclic network},
author={Angela I. Barbero Diez and Oyvind Ytrehus},
journal={arXiv preprint arXiv:0705.0085},
year={2007},
archivePrefix={arXiv},
eprint={0705.0085},
primaryClass={cs.IT ... | diez2007an |
arxiv-199 | 0705.0086 | About the domino problem in the hyperbolic plane, a new solution: complement | <|reference_start|>About the domino problem in the hyperbolic plane, a new solution: complement: In this paper, we complete the construction of paper arXiv:cs.CG/0701096v2. Together with the proof contained in arXiv:cs.CG/0701096v2, this paper definitely proves that the general problem of tiling the hyperbolic plane wi... | arxiv | @article{margenstern2007about,
title={About the domino problem in the hyperbolic plane, a new solution:
complement},
author={Maurice Margenstern},
journal={M. Margenstern, "The domino problem of the hyperbolic plane is
undecidable", Theoretical Computer Science, vol. 407, (2008), 29-84},
year={2007}... | margenstern2007about |
arxiv-200 | 0705.0123 | An Energy Efficiency Perspective on Training for Fading Channels | <|reference_start|>An Energy Efficiency Perspective on Training for Fading Channels: In this paper, the bit energy requirements of training-based transmission over block Rayleigh fading channels are studied. Pilot signals are employed to obtain the minimum mean-square-error (MMSE) estimate of the channel fading coeffic... | arxiv | @article{gursoy2007an,
title={An Energy Efficiency Perspective on Training for Fading Channels},
author={Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0705.0123},
year={2007},
doi={10.1109/ISIT.2007.4557387},
archivePrefix={arXiv},
eprint={0705.0123},
primaryClass={cs.IT math.IT}
} | gursoy2007an |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.