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-601 | 0706.3459 | NP by means of lifts and shadows | <|reference_start|>NP by means of lifts and shadows: We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by means of shadows (projections) and by finitely many forbidden colored (lifted) subgraphs. ... | arxiv | @article{kun2007np,
title={NP by means of lifts and shadows},
author={Gabor Kun, Jaroslav Nesetril},
journal={arXiv preprint arXiv:0706.3459},
year={2007},
archivePrefix={arXiv},
eprint={0706.3459},
primaryClass={cs.CC math.CO}
} | kun2007np |
arxiv-602 | 0706.3479 | Hypocomputation | <|reference_start|>Hypocomputation: Hypercomputational formal theories will, clearly, be both structurally and foundationally different from the formal theories underpinning computational theories. However, many of the maps that might guide us into this strange realm have been lost. So little work has been done recentl... | arxiv | @article{love2007hypocomputation,
title={Hypocomputation},
author={David Love},
journal={arXiv preprint arXiv:0706.3479},
year={2007},
archivePrefix={arXiv},
eprint={0706.3479},
primaryClass={cs.OH}
} | love2007hypocomputation |
arxiv-603 | 0706.3480 | Tight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes | <|reference_start|>Tight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes: In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper bounds on the average length, entropy, and redundancy of such codes in terms of the alphabet size of the source... | arxiv | @article{mohajer2007tight,
title={Tight Bounds on the Average Length, Entropy, and Redundancy of
Anti-Uniform Huffman Codes},
author={Soheil Mohajer and Ali Kakhbod},
journal={IET Communications, vol. 5, no. 9, pp. 1213-1219, 2011},
year={2007},
archivePrefix={arXiv},
eprint={0706.3480},
p... | mohajer2007tight |
arxiv-604 | 0706.3502 | Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels | <|reference_start|>Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels: Explicit codes are constructed that achieve the diversity-multiplexing gain tradeoff of the cooperative-relay channel under the dynamic decode-and-forward protocol for any netwo... | arxiv | @article{elia2007approximately-universal,
title={Approximately-Universal Space-Time Codes for the Parallel, Multi-Block
and Cooperative-Dynamic-Decode-and-Forward Channels},
author={Petros Elia and P. Vijay Kumar},
journal={arXiv preprint arXiv:0706.3502},
year={2007},
archivePrefix={arXiv},
e... | elia2007approximately-universal |
arxiv-605 | 0706.3523 | There Exist some Omega-Powers of Any Borel Rank | <|reference_start|>There Exist some Omega-Powers of Any Borel Rank: Omega-powers of finitary languages are languages of infinite words (omega-languages) in the form V^omega, where V is a finitary language over a finite alphabet X. They appear very naturally in the characterizaton of regular or context-free omega-langua... | arxiv | @article{lecomte2007there,
title={There Exist some Omega-Powers of Any Borel Rank},
author={Dominique Lecomte (UMR 7586), Olivier Finkel (LIP)},
journal={Dans Proceedings of the 16th EACSL Annual Conference on Computer
Science and Logic, CSL 2007, - 16th EACSL Annual Conference on Computer
Science and L... | lecomte2007there |
arxiv-606 | 0706.3546 | stdchk: A Checkpoint Storage System for Desktop Grid Computing | <|reference_start|>stdchk: A Checkpoint Storage System for Desktop Grid Computing: Checkpointing is an indispensable technique to provide fault tolerance for long-running high-throughput applications like those running on desktop grids. This paper argues that a dedicated checkpoint storage system, optimized to operate ... | arxiv | @article{kiswany2007stdchk:,
title={stdchk: A Checkpoint Storage System for Desktop Grid Computing},
author={Samer Al Kiswany, Matei Ripeanu, Sudharshan S. Vazhkudai, Abdullah
Gharaibeh},
journal={arXiv preprint arXiv:0706.3546},
year={2007},
archivePrefix={arXiv},
eprint={0706.3546},
prim... | kiswany2007stdchk: |
arxiv-607 | 0706.3565 | Experimental Algorithm for the Maximum Independent Set Problem | <|reference_start|>Experimental Algorithm for the Maximum Independent Set Problem: We develop an experimental algorithm for the exact solving of the maximum independent set problem. The algorithm consecutively finds the maximal independent sets of vertices in an arbitrary undirected graph such that the next such set co... | arxiv | @article{plotnikov2007experimental,
title={Experimental Algorithm for the Maximum Independent Set Problem},
author={Anatoly D. Plotnikov},
journal={Cybernetics and Systems Analysis: Volume 48, Issue 5 (2012), Page
673-680},
year={2007},
archivePrefix={arXiv},
eprint={0706.3565},
primaryCla... | plotnikov2007experimental |
arxiv-608 | 0706.3639 | A Collection of Definitions of Intelligence | <|reference_start|>A Collection of Definitions of Intelligence: This paper is a survey of a large number of informal definitions of ``intelligence'' that the authors have collected over the years. Naturally, compiling a complete list would be impossible as many definitions of intelligence are buried deep inside article... | arxiv | @article{legg2007a,
title={A Collection of Definitions of Intelligence},
author={Shane Legg and Marcus Hutter},
journal={Frontiers in Artificial Intelligence and Applications, Vol.157
(2007) 17-24},
year={2007},
number={IDSIA-07-07},
archivePrefix={arXiv},
eprint={0706.3639},
primaryCl... | legg2007a |
arxiv-609 | 0706.3679 | Scale-sensitive Psi-dimensions: the Capacity Measures for Classifiers Taking Values in R^Q | <|reference_start|>Scale-sensitive Psi-dimensions: the Capacity Measures for Classifiers Taking Values in R^Q: Bounds on the risk play a crucial role in statistical learning theory. They usually involve as capacity measure of the model studied the VC dimension or one of its extensions. In classification, such "VC dimen... | arxiv | @article{guermeur2007scale-sensitive,
title={Scale-sensitive Psi-dimensions: the Capacity Measures for Classifiers
Taking Values in R^Q},
author={Yann Guermeur (LORIA)},
journal={ASMDA 2007 (2007) 1-8},
year={2007},
archivePrefix={arXiv},
eprint={0706.3679},
primaryClass={cs.LG}
} | guermeur2007scale-sensitive |
arxiv-610 | 0706.3710 | Optimal Constellations for the Low SNR Noncoherent MIMO Block Rayleigh Fading Channel | <|reference_start|>Optimal Constellations for the Low SNR Noncoherent MIMO Block Rayleigh Fading Channel: Reliable communication over the discrete-input/continuous-output noncoherent multiple-input multiple-output (MIMO) Rayleigh block fading channel is considered when the signal-to-noise ratio (SNR) per degree of free... | arxiv | @article{srinivasan2007optimal,
title={Optimal Constellations for the Low SNR Noncoherent MIMO Block Rayleigh
Fading Channel},
author={Shivratna Giri Srinivasan and Mahesh K. Varanasi},
journal={arXiv preprint arXiv:0706.3710},
year={2007},
archivePrefix={arXiv},
eprint={0706.3710},
primar... | srinivasan2007optimal |
arxiv-611 | 0706.3723 | Order-Invariant MSO is Stronger than Counting MSO in the Finite | <|reference_start|>Order-Invariant MSO is Stronger than Counting MSO in the Finite: We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers, al... | arxiv | @article{ganzow2007order-invariant,
title={Order-Invariant MSO is Stronger than Counting MSO in the Finite},
author={Tobias Ganzow and Sasha Rubin},
journal={Dans Proceedings of the 25th Annual Symposium on the Theoretical
Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)},
year={2007... | ganzow2007order-invariant |
arxiv-612 | 0706.3750 | Pruning Processes and a New Characterization of Convex Geometries | <|reference_start|>Pruning Processes and a New Characterization of Convex Geometries: We provide a new characterization of convex geometries via a multivariate version of an identity that was originally proved by Maneva, Mossel and Wainwright for certain combinatorial objects arising in the context of the k-SAT problem... | arxiv | @article{ardila2007pruning,
title={Pruning Processes and a New Characterization of Convex Geometries},
author={Federico Ardila and Elitza Maneva},
journal={arXiv preprint arXiv:0706.3750},
year={2007},
archivePrefix={arXiv},
eprint={0706.3750},
primaryClass={math.CO cs.DM math.PR}
} | ardila2007pruning |
arxiv-613 | 0706.3752 | Secure Nested Codes for Type II Wiretap Channels | <|reference_start|>Secure Nested Codes for Type II Wiretap Channels: This paper considers the problem of secure coding design for a type II wiretap channel, where the main channel is noiseless and the eavesdropper channel is a general binary-input symmetric-output memoryless channel. The proposed secure error-correctin... | arxiv | @article{liu2007secure,
title={Secure Nested Codes for Type II Wiretap Channels},
author={Ruoheng Liu, Yingbin Liang, H. Vincent Poor, and Predrag Spasojevic},
journal={arXiv preprint arXiv:0706.3752},
year={2007},
doi={10.1109/ITW.2007.4313097},
archivePrefix={arXiv},
eprint={0706.3752},
... | liu2007secure |
arxiv-614 | 0706.3753 | Multiple Access Channels with Generalized Feedback and Confidential Messages | <|reference_start|>Multiple Access Channels with Generalized Feedback and Confidential Messages: This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passi... | arxiv | @article{tang2007multiple,
title={Multiple Access Channels with Generalized Feedback and Confidential
Messages},
author={Xiaojun Tang, Ruoheng Liu, Predrag Spasojevic, and H. Vincent Poor},
journal={arXiv preprint arXiv:0706.3753},
year={2007},
doi={10.1109/ITW.2007.4313144},
archivePrefix={ar... | tang2007multiple |
arxiv-615 | 0706.3768 | Dynamic Exploration of Networks: from general principles to the traceroute process | <|reference_start|>Dynamic Exploration of Networks: from general principles to the traceroute process: Dynamical processes taking place on real networks define on them evolving subnetworks whose topology is not necessarily the same of the underlying one. We investigate the problem of determining the emerging degree dis... | arxiv | @article{dall'asta2007dynamic,
title={Dynamic Exploration of Networks: from general principles to the
traceroute process},
author={Luca Dall'Asta},
journal={arXiv preprint arXiv:0706.3768},
year={2007},
doi={10.1140/epjb/e2007-00326-9},
archivePrefix={arXiv},
eprint={0706.3768},
primar... | dall'asta2007dynamic |
arxiv-616 | 0706.3812 | Java Components Vulnerabilities - An Experimental Classification Targeted at the OSGi Platform | <|reference_start|>Java Components Vulnerabilities - An Experimental Classification Targeted at the OSGi Platform: The OSGi Platform finds a growing interest in two different applications domains: embedded systems, and applications servers. However, the security properties of this platform are hardly studied, which is ... | arxiv | @article{parrend2007java,
title={Java Components Vulnerabilities - An Experimental Classification
Targeted at the OSGi Platform},
author={Pierre Parrend (INRIA Rh^one-Alpes), St'ephane Fr'enot (INRIA
Rh^one-Alpes)},
journal={arXiv preprint arXiv:0706.3812},
year={2007},
archivePrefix={arXiv},
... | parrend2007java |
arxiv-617 | 0706.3834 | Design of optimal convolutional codes for joint decoding of correlated sources in wireless sensor networks | <|reference_start|>Design of optimal convolutional codes for joint decoding of correlated sources in wireless sensor networks: We consider a wireless sensors network scenario where two nodes detect correlated sources and deliver them to a central collector via a wireless link. Differently from the Slepian-Wolf approach... | arxiv | @article{abrardo2007design,
title={Design of optimal convolutional codes for joint decoding of correlated
sources in wireless sensor networks},
author={A. Abrardo},
journal={arXiv preprint arXiv:0706.3834},
year={2007},
archivePrefix={arXiv},
eprint={0706.3834},
primaryClass={cs.IT math.IT... | abrardo2007design |
arxiv-618 | 0706.3846 | Opportunistic Scheduling and Beamforming for MIMO-SDMA Downlink Systems with Linear Combining | <|reference_start|>Opportunistic Scheduling and Beamforming for MIMO-SDMA Downlink Systems with Linear Combining: Opportunistic scheduling and beamforming schemes are proposed for multiuser MIMO-SDMA downlink systems with linear combining in this work. Signals received from all antennas of each mobile terminal (MT) are... | arxiv | @article{pun2007opportunistic,
title={Opportunistic Scheduling and Beamforming for MIMO-SDMA Downlink Systems
with Linear Combining},
author={Man-On Pun, Visa Koivunen and H. Vincent Poor},
journal={arXiv preprint arXiv:0706.3846},
year={2007},
doi={10.1109/PIMRC.2007.4394179},
archivePrefix={... | pun2007opportunistic |
arxiv-619 | 0706.3848 | Minimum Sum Edge Colorings of Multicycles | <|reference_start|>Minimum Sum Edge Colorings of Multicycles: In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assigned to the edges is minimum. The {\em chromatic edge strength} of a graph is the... | arxiv | @article{cardinal2007minimum,
title={Minimum Sum Edge Colorings of Multicycles},
author={Jean Cardinal (ULB), Vlady Ravelomanana (LIPN), Mario Valencia-Pabon
(LIPN)},
journal={arXiv preprint arXiv:0706.3848},
year={2007},
archivePrefix={arXiv},
eprint={0706.3848},
primaryClass={cs.DM}
} | cardinal2007minimum |
arxiv-620 | 0706.3856 | Approximations of Lovasz extensions and their induced interaction index | <|reference_start|>Approximations of Lovasz extensions and their induced interaction index: The Lovasz extension of a pseudo-Boolean function $f : \{0,1\}^n \to R$ is defined on each simplex of the standard triangulation of $[0,1]^n$ as the unique affine function $\hat f : [0,1]^n \to R$ that interpolates $f$ at the $n... | arxiv | @article{marichal2007approximations,
title={Approximations of Lovasz extensions and their induced interaction index},
author={Jean-Luc Marichal, Pierre Mathonet},
journal={Discrete Applied Mathematics 156 (1) (2008) 11-24},
year={2007},
archivePrefix={arXiv},
eprint={0706.3856},
primaryClass... | marichal2007approximations |
arxiv-621 | 0706.3865 | Bid Optimization for Internet Graphical Ad Auction Systems via Special Ordered Sets | <|reference_start|>Bid Optimization for Internet Graphical Ad Auction Systems via Special Ordered Sets: This paper describes an optimization model for setting bid levels for certain types of advertisements on web pages. This model is non-convex, but we are able to obtain optimal or near-optimal solutions rapidly using ... | arxiv | @article{wiggins2007bid,
title={Bid Optimization for Internet Graphical Ad Auction Systems via Special
Ordered Sets},
author={Ralphe Wiggins and John A. Tomlin},
journal={arXiv preprint arXiv:0706.3865},
year={2007},
number={YR-2007-004},
archivePrefix={arXiv},
eprint={0706.3865},
prim... | wiggins2007bid |
arxiv-622 | 0706.3984 | A Comparison of Push and Pull Techniques for Ajax | <|reference_start|>A Comparison of Push and Pull Techniques for Ajax: Ajax applications are designed to have high user interactivity and low user-perceived latency. Real-time dynamic web data such as news headlines, stock tickers, and auction updates need to be propagated to the users as soon as possible. However, Ajax... | arxiv | @article{bozdag2007a,
title={A Comparison of Push and Pull Techniques for Ajax},
author={Engin Bozdag, Ali Mesbah, Arie van Deursen},
journal={arXiv preprint arXiv:0706.3984},
year={2007},
archivePrefix={arXiv},
eprint={0706.3984},
primaryClass={cs.SE cs.PF}
} | bozdag2007a |
arxiv-623 | 0706.4004 | End-to-End Available Bandwidth Measurement Tools : A Comparative Evaluation of Performances | <|reference_start|>End-to-End Available Bandwidth Measurement Tools : A Comparative Evaluation of Performances: In recent years, there has been a strong interest in measuring the available bandwidth of network paths. Several methods and techniques have been proposed and various measurement tools have been developed and... | arxiv | @article{ali2007end-to-end,
title={End-to-End Available Bandwidth Measurement Tools : A Comparative
Evaluation of Performances},
author={Ahmed Ait Ali (CRAN), Fabien Michaut (CRAN), Francis Lepage (CRAN)},
journal={IPS-MoMe 2006 IEEE /ACM International workshop on Internet
Performance, Simulation, Monit... | ali2007end-to-end |
arxiv-624 | 0706.4009 | Multi-criteria scheduling of pipeline workflows | <|reference_start|>Multi-criteria scheduling of pipeline workflows: Mapping workflow applications onto parallel platforms is a challenging problem, even for simple application patterns such as pipeline graphs. Several antagonist criteria should be optimized, such as throughput and latency (or a combination). In this pa... | arxiv | @article{benoit2007multi-criteria,
title={Multi-criteria scheduling of pipeline workflows},
author={Anne Benoit (INRIA Rh^one-Alpes, LIP), Veronika Rehn-Sonigo (INRIA
Rh^one-Alpes, LIP), Yves Robert (INRIA Rh^one-Alpes, LIP)},
journal={arXiv preprint arXiv:0706.4009},
year={2007},
archivePrefix={a... | benoit2007multi-criteria |
arxiv-625 | 0706.4015 | Self-Stabilizing Wavelets and r-Hops Coordination | <|reference_start|>Self-Stabilizing Wavelets and r-Hops Coordination: We introduce a simple tool called the wavelet (or, r-wavelet) scheme. Wavelets deals with coordination among processes which are at most r hops away of each other. We present a selfstabilizing solution for this scheme. Our solution requires no underl... | arxiv | @article{boulinier2007self-stabilizing,
title={Self-Stabilizing Wavelets and r-Hops Coordination},
author={Christian Boulinier (LaRIA), Franck Petit (LaRIA)},
journal={Rapport Interne (01/04/2007)},
year={2007},
archivePrefix={arXiv},
eprint={0706.4015},
primaryClass={cs.DC}
} | boulinier2007self-stabilizing |
arxiv-626 | 0706.4035 | Encounter-based worms: Analysis and Defense | <|reference_start|>Encounter-based worms: Analysis and Defense: Encounter-based network is a frequently-disconnected wireless ad-hoc network requiring immediate neighbors to store and forward aggregated data for information disseminations. Using traditional approaches such as gateways or firewalls for deterring worm pr... | arxiv | @article{tanachaiwiwat2007encounter-based,
title={Encounter-based worms: Analysis and Defense},
author={Sapon Tanachaiwiwat, Ahmed Helmy},
journal={arXiv preprint arXiv:0706.4035},
year={2007},
archivePrefix={arXiv},
eprint={0706.4035},
primaryClass={cs.NI cs.CR}
} | tanachaiwiwat2007encounter-based |
arxiv-627 | 0706.4038 | Scheduling multiple divisible loads on a linear processor network | <|reference_start|>Scheduling multiple divisible loads on a linear processor network: Min, Veeravalli, and Barlas have recently proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more installments. We show on a very simple example... | arxiv | @article{gallet2007scheduling,
title={Scheduling multiple divisible loads on a linear processor network},
author={Matthieu Gallet (LIP, INRIA Rh^one-Alpes), Yves Robert (LIP, INRIA
Rh^one-Alpes), Fr'ed'eric Vivien (LIP, INRIA Rh^one-Alpes)},
journal={arXiv preprint arXiv:0706.4038},
year={2007},
a... | gallet2007scheduling |
arxiv-628 | 0706.4044 | PSPACE Bounds for Rank-1 Modal Logics | <|reference_start|>PSPACE Bounds for Rank-1 Modal Logics: For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main resul... | arxiv | @article{schröder2007pspace,
title={PSPACE Bounds for Rank-1 Modal Logics},
author={Lutz Schr"oder and Dirk Pattinson},
journal={ACM Transactions on Computational Logic 10 (2:13), pp. 1-33, 2009},
year={2007},
doi={10.1145/1462179.1462185},
number={Imperial College TR 2007/4},
archivePrefix=... | schröder2007pspace |
arxiv-629 | 0706.4048 | Getting More From Your Multicore: Exploiting OpenMP From An Open Source Numerical Scripting Language | <|reference_start|>Getting More From Your Multicore: Exploiting OpenMP From An Open Source Numerical Scripting Language: We introduce SLIRP, a module generator for the S-Lang numerical scripting language, with a focus on its vectorization capabilities. We demonstrate how both SLIRP and S-Lang were easily adapted to exp... | arxiv | @article{noble2007getting,
title={Getting More From Your Multicore: Exploiting OpenMP From An Open Source
Numerical Scripting Language},
author={Michael S. Noble},
journal={arXiv preprint arXiv:0706.4048},
year={2007},
archivePrefix={arXiv},
eprint={0706.4048},
primaryClass={cs.DC astro-ph... | noble2007getting |
arxiv-630 | 0706.4095 | Some Quantitative Aspects of Fractional Computability | <|reference_start|>Some Quantitative Aspects of Fractional Computability: Motivated by results on generic-case complexity in group theory, we apply the ideas of effective Baire category and effective measure theory to study complexity classes of functions which are "fractionally computable" by a partial algorithm. For ... | arxiv | @article{kapovich2007some,
title={Some Quantitative Aspects of Fractional Computability},
author={Ilya Kapovich and Paul Schupp},
journal={arXiv preprint arXiv:0706.4095},
year={2007},
archivePrefix={arXiv},
eprint={0706.4095},
primaryClass={math.GR cs.CC}
} | kapovich2007some |
arxiv-631 | 0706.4107 | Radix Sorting With No Extra Space | <|reference_start|>Radix Sorting With No Extra Space: It is well known that n integers in the range [1,n^c] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1,U] can be sorted in O(n sqrt{loglog n}) time. However, these algorithms use O(n) words of extra memory. Is... | arxiv | @article{franceschini2007radix,
title={Radix Sorting With No Extra Space},
author={Gianni Franceschini, S. Muthukrishnan and Mihai Patrascu},
journal={arXiv preprint arXiv:0706.4107},
year={2007},
archivePrefix={arXiv},
eprint={0706.4107},
primaryClass={cs.DS}
} | franceschini2007radix |
arxiv-632 | 0706.4161 | The Domino Problem of the Hyperbolic Plane Is Undecidable | <|reference_start|>The Domino Problem of the Hyperbolic Plane Is Undecidable: In this paper, we prove that the general tiling problem of the hyperbolic plane is undecidable by proving a slightly stronger version using only a regular polygon as the basic shape of the tiles. The problem was raised by a paper of Raphael R... | arxiv | @article{margenstern2007the,
title={The Domino Problem of the Hyperbolic Plane Is Undecidable},
author={Maurice Margenstern},
journal={The Bulletin of EATCS, 93(Oct.), (2007), 220-237},
year={2007},
archivePrefix={arXiv},
eprint={0706.4161},
primaryClass={cs.CG cs.DM}
} | margenstern2007the |
arxiv-633 | 0706.4170 | Hilbert++ Manual | <|reference_start|>Hilbert++ Manual: We present here an installation guide, a hand-on mini-tutorial through examples, and the theoretical foundations of the Hilbert++ code.<|reference_end|> | arxiv | @article{mirone2007hilbert++,
title={Hilbert++ Manual},
author={Alessandro Mirone},
journal={arXiv preprint arXiv:0706.4170},
year={2007},
archivePrefix={arXiv},
eprint={0706.4170},
primaryClass={cs.OH cond-mat.str-el}
} | mirone2007hilbert++ |
arxiv-634 | 0706.4175 | Heuristics for Network Coding in Wireless Networks | <|reference_start|>Heuristics for Network Coding in Wireless Networks: Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this report, we study one specific case of multicast: broadcasting, sending data... | arxiv | @article{cho2007heuristics,
title={Heuristics for Network Coding in Wireless Networks},
author={Song Yean Cho (INRIA Rocquencourt), C'edric Adjih (INRIA
Rocquencourt), Philippe Jacquet (INRIA Rocquencourt)},
journal={arXiv preprint arXiv:0706.4175},
year={2007},
archivePrefix={arXiv},
eprint={... | cho2007heuristics |
arxiv-635 | 0706.4224 | User driven applications - new design paradigm | <|reference_start|>User driven applications - new design paradigm: Programs for complicated engineering and scientific tasks always have to deal with a problem of showing numerous graphical results. The limits of the screen space and often opposite requirements from different users are the cause of the infinite discuss... | arxiv | @article{andreyev2007user,
title={User driven applications - new design paradigm},
author={Sergey Andreyev},
journal={arXiv preprint arXiv:0706.4224},
year={2007},
archivePrefix={arXiv},
eprint={0706.4224},
primaryClass={cs.GR cs.HC}
} | andreyev2007user |
arxiv-636 | 0706.4298 | Unison as a Self-Stabilizing Wave Stream Algorithm in Asynchronous Anonymous Networks | <|reference_start|>Unison as a Self-Stabilizing Wave Stream Algorithm in Asynchronous Anonymous Networks: How to pass from local to global scales in anonymous networks? How to organize a selfstabilizing propagation of information with feedback. From the Angluin impossibility results, we cannot elect a leader in a gener... | arxiv | @article{boulinier2007unison,
title={Unison as a Self-Stabilizing Wave Stream Algorithm in Asynchronous
Anonymous Networks},
author={Christian Boulinier (LaRIA)},
journal={Rapport de recherche. (28/06/2007)},
year={2007},
archivePrefix={arXiv},
eprint={0706.4298},
primaryClass={cs.DC}
} | boulinier2007unison |
arxiv-637 | 0706.4323 | Theory of Finite or Infinite Trees Revisited | <|reference_start|>Theory of Finite or Infinite Trees Revisited: We present in this paper a first-order axiomatization of an extended theory $T$ of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation $\fini(t)$ which enables to distinguish between finite or infin... | arxiv | @article{djelloul2007theory,
title={Theory of Finite or Infinite Trees Revisited},
author={Khalil Djelloul, Thi-bich-hanh Dao and Thom Fruehwirth},
journal={arXiv preprint arXiv:0706.4323},
year={2007},
archivePrefix={arXiv},
eprint={0706.4323},
primaryClass={cs.LO cs.AI}
} | djelloul2007theory |
arxiv-638 | 0706.4375 | A Robust Linguistic Platform for Efficient and Domain specific Web Content Analysis | <|reference_start|>A Robust Linguistic Platform for Efficient and Domain specific Web Content Analysis: Web semantic access in specific domains calls for specialized search engines with enhanced semantic querying and indexing capacities, which pertain both to information retrieval (IR) and to information extraction (IE... | arxiv | @article{hamon2007a,
title={A Robust Linguistic Platform for Efficient and Domain specific Web
Content Analysis},
author={Thierry Hamon (LIPN), Adeline Nazarenko (LIPN), Thierry Poibeau
(LIPN), Sophie Aubin (LIPN), Julien Derivi`ere (LIPN)},
journal={Proceedings of RIAO 2007 (30/05/2007)},
year={200... | hamon2007a |
arxiv-639 | 0706.4440 | 2-State 3-Symbol Universal Turing Machines Do Not Exist | <|reference_start|>2-State 3-Symbol Universal Turing Machines Do Not Exist: In this brief note, we give a simple information-theoretic proof that 2-state 3-symbol universal Turing machines cannot possibly exist, unless one loosens the definition of "universal".<|reference_end|> | arxiv | @article{feinstein20072-state,
title={2-State 3-Symbol Universal Turing Machines Do Not Exist},
author={Craig Alan Feinstein},
journal={arXiv preprint arXiv:0706.4440},
year={2007},
archivePrefix={arXiv},
eprint={0706.4440},
primaryClass={cs.OH}
} | feinstein20072-state |
arxiv-640 | 0707.0050 | Non-atomic Games for Multi-User Systems | <|reference_start|>Non-atomic Games for Multi-User Systems: In this contribution, the performance of a multi-user system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful framework is provided in order to determine the optimal power allocation when users know only t... | arxiv | @article{bonneau2007non-atomic,
title={Non-atomic Games for Multi-User Systems},
author={Nicolas Bonneau, M'erouane Debbah, Eitan Altman, Are Hj{o}rungnes},
journal={arXiv preprint arXiv:0707.0050},
year={2007},
doi={10.1109/JSAC.2008.080903},
archivePrefix={arXiv},
eprint={0707.0050},
p... | bonneau2007non-atomic |
arxiv-641 | 0707.0181 | Location and Spectral Estimation of Weak Wave Packets on Noise Background | <|reference_start|>Location and Spectral Estimation of Weak Wave Packets on Noise Background: The method of location and spectral estimation of weak signals on a noise background is being considered. The method is based on the optimized on order and noise dispersion autoregressive model of a sought signal. A new approa... | arxiv | @article{bunyak2007location,
title={Location and Spectral Estimation of Weak Wave Packets on Noise
Background},
author={Yu. Bunyak and O. Bunyak},
journal={arXiv preprint arXiv:0707.0181},
year={2007},
archivePrefix={arXiv},
eprint={0707.0181},
primaryClass={cs.CE}
} | bunyak2007location |
arxiv-642 | 0707.0234 | Selection Relaying at Low Signal to Noise Ratios | <|reference_start|>Selection Relaying at Low Signal to Noise Ratios: Performance of cooperative diversity schemes at Low Signal to Noise Ratios (LSNR) was recently studied by Avestimehr et. al. [1] who emphasized the importance of diversity gain over multiplexing gain at low SNRs. It has also been pointed out that cont... | arxiv | @article{rajawat2007selection,
title={Selection Relaying at Low Signal to Noise Ratios},
author={Ketan Rajawat and Adrish Banerjee},
journal={arXiv preprint arXiv:0707.0234},
year={2007},
archivePrefix={arXiv},
eprint={0707.0234},
primaryClass={cs.IT math.IT}
} | rajawat2007selection |
arxiv-643 | 0707.0282 | Directed Feedback Vertex Set is Fixed-Parameter Tractable | <|reference_start|>Directed Feedback Vertex Set is Fixed-Parameter Tractable: We resolve positively a long standing open question regarding the fixed-parameter tractability of the parameterized Directed Feedback Vertex Set problem. In particular, we propose an algorithm which solves this problem in $O(8^kk!*poly(n))$.<... | arxiv | @article{razgon2007directed,
title={Directed Feedback Vertex Set is Fixed-Parameter Tractable},
author={Igor Razgon and Barry O'Sullivan},
journal={arXiv preprint arXiv:0707.0282},
year={2007},
archivePrefix={arXiv},
eprint={0707.0282},
primaryClass={cs.DS cs.CC}
} | razgon2007directed |
arxiv-644 | 0707.0285 | A Generalized Sampling Theorem for Frequency Localized Signals | <|reference_start|>A Generalized Sampling Theorem for Frequency Localized Signals: A generalized sampling theorem for frequency localized signals is presented. The generalization in the proposed model of sampling is twofold: (1) It applies to various prefilters effecting a "soft" bandlimitation, (2) an approximate reco... | arxiv | @article{hammerich2007a,
title={A Generalized Sampling Theorem for Frequency Localized Signals},
author={Edwin Hammerich},
journal={Sampl. Theory Signal Image Process., Vol. 8, No. 2, May 2009, pp.
127-146},
year={2007},
archivePrefix={arXiv},
eprint={0707.0285},
primaryClass={cs.IT math.I... | hammerich2007a |
arxiv-645 | 0707.0323 | Interference Alignment and the Degrees of Freedom for the K User Interference Channel | <|reference_start|>Interference Alignment and the Degrees of Freedom for the K User Interference Channel: While the best known outerbound for the K user interference channel states that there cannot be more than K/2 degrees of freedom, it has been conjectured that in general the constant interference channel with any n... | arxiv | @article{cadambe2007interference,
title={Interference Alignment and the Degrees of Freedom for the K User
Interference Channel},
author={Viveck R. Cadambe, Syed A. Jafar},
journal={arXiv preprint arXiv:0707.0323},
year={2007},
archivePrefix={arXiv},
eprint={0707.0323},
primaryClass={cs.IT ... | cadambe2007interference |
arxiv-646 | 0707.0336 | Pricing Options on Defaultable Stocks | <|reference_start|>Pricing Options on Defaultable Stocks: In this note, we develop stock option price approximations for a model which takes both the risk o default and the stochastic volatility into account. We also let the intensity of defaults be influenced by the volatility. We show that it might be possible to inf... | arxiv | @article{bayraktar2007pricing,
title={Pricing Options on Defaultable Stocks},
author={Erhan Bayraktar},
journal={arXiv preprint arXiv:0707.0336},
year={2007},
archivePrefix={arXiv},
eprint={0707.0336},
primaryClass={cs.CE}
} | bayraktar2007pricing |
arxiv-647 | 0707.0365 | Performance Analysis of Publish/Subscribe Systems | <|reference_start|>Performance Analysis of Publish/Subscribe Systems: The Desktop Grid offers solutions to overcome several challenges and to answer increasingly needs of scientific computing. Its technology consists mainly in exploiting resources, geographically dispersed, to treat complex applications needing big pow... | arxiv | @article{abbes2007performance,
title={Performance Analysis of Publish/Subscribe Systems},
author={Heithem Abbes (UTIC), Christophe C'erin (LIPN), Jean-Christophe
Dubacq (LIPN), Mohamed Jemni (UTIC)},
journal={Rapport Interne LIPN (15/05/2007)},
year={2007},
archivePrefix={arXiv},
eprint={0707.... | abbes2007performance |
arxiv-648 | 0707.0397 | Robust Audio Watermarking Against the D/A and A/D conversions | <|reference_start|>Robust Audio Watermarking Against the D/A and A/D conversions: Audio watermarking has played an important role in multimedia security. In many applications using audio watermarking, D/A and A/D conversions (denoted by DA/AD in this paper) are often involved. In previous works, however, the robustness... | arxiv | @article{xiang2007robust,
title={Robust Audio Watermarking Against the D/A and A/D conversions},
author={Shijun Xiang and Jiwu Huang},
journal={arXiv preprint arXiv:0707.0397},
year={2007},
archivePrefix={arXiv},
eprint={0707.0397},
primaryClass={cs.CR cs.MM}
} | xiang2007robust |
arxiv-649 | 0707.0421 | The $k$-anonymity Problem is Hard | <|reference_start|>The $k$-anonymity Problem is Hard: The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization recently proposed is the k-anonymity. This approach requires that the rows in a table are clustered in sets of size at least k and that... | arxiv | @article{bonizzoni2007the,
title={The $k$-anonymity Problem is Hard},
author={Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi},
journal={arXiv preprint arXiv:0707.0421},
year={2007},
archivePrefix={arXiv},
eprint={0707.0421},
primaryClass={cs.DB cs.CC cs.DS}
} | bonizzoni2007the |
arxiv-650 | 0707.0430 | Assisted Problem Solving and Decompositions of Finite Automata | <|reference_start|>Assisted Problem Solving and Decompositions of Finite Automata: A study of assisted problem solving formalized via decompositions of deterministic finite automata is initiated. The landscape of new types of decompositions of finite automata this study uncovered is presented. Languages with various de... | arxiv | @article{gaži2007assisted,
title={Assisted Problem Solving and Decompositions of Finite Automata},
author={Peter Gav{z}i, Branislav Rovan},
journal={arXiv preprint arXiv:0707.0430},
year={2007},
archivePrefix={arXiv},
eprint={0707.0430},
primaryClass={cs.CC}
} | gaži2007assisted |
arxiv-651 | 0707.0454 | Optimal Strategies for Gaussian Jamming in Block-Fading Channels under Delay and Power Constraints | <|reference_start|>Optimal Strategies for Gaussian Jamming in Block-Fading Channels under Delay and Power Constraints: Without assuming any knowledge on source's codebook and its output signals, we formulate a Gaussian jamming problem in block fading channels as a two-player zero sum game. The outage probability is ado... | arxiv | @article{amariucai2007optimal,
title={Optimal Strategies for Gaussian Jamming in Block-Fading Channels under
Delay and Power Constraints},
author={George T. Amariucai, Shuangqing Wei and Rajgopal Kannan},
journal={arXiv preprint arXiv:0707.0454},
year={2007},
archivePrefix={arXiv},
eprint={070... | amariucai2007optimal |
arxiv-652 | 0707.0459 | Physical Network Coding in Two-Way Wireless Relay Channels | <|reference_start|>Physical Network Coding in Two-Way Wireless Relay Channels: It has recently been recognized that the wireless networks represent a fertile ground for devising communication modes based on network coding. A particularly suitable application of the network coding arises for the two--way relay channels,... | arxiv | @article{popovski2007physical,
title={Physical Network Coding in Two-Way Wireless Relay Channels},
author={Petar Popovski and Hiroyuki Yomo},
journal={Proc. of IEEE International Conference on Communications (ICC),
Glasgow, Scotland, 2007},
year={2007},
archivePrefix={arXiv},
eprint={0707.0459... | popovski2007physical |
arxiv-653 | 0707.0463 | Blind Estimation of Multiple Carrier Frequency Offsets | <|reference_start|>Blind Estimation of Multiple Carrier Frequency Offsets: Multiple carrier-frequency offsets (CFO) arise in a distributed antenna system, where data are transmitted simultaneously from multiple antennas. In such systems the received signal contains multiple CFOs due to mismatch between the local oscill... | arxiv | @article{yu2007blind,
title={Blind Estimation of Multiple Carrier Frequency Offsets},
author={Yuanning Yu, Athina P. Petropulu, H. Vincent Poor and Visa Koivunen},
journal={arXiv preprint arXiv:0707.0463},
year={2007},
doi={10.1109/PIMRC.2007.4394103},
archivePrefix={arXiv},
eprint={0707.046... | yu2007blind |
arxiv-654 | 0707.0476 | Fractional Power Control for Decentralized Wireless Networks | <|reference_start|>Fractional Power Control for Decentralized Wireless Networks: We consider a new approach to power control in decentralized wireless networks, termed fractional power control (FPC). Transmission power is chosen as the current channel quality raised to an exponent -s, where s is a constant between 0 an... | arxiv | @article{jindal2007fractional,
title={Fractional Power Control for Decentralized Wireless Networks},
author={Nihar Jindal, Steven Weber, Jeffrey G. Andrews},
journal={arXiv preprint arXiv:0707.0476},
year={2007},
doi={10.1109/T-WC.2008.071439},
archivePrefix={arXiv},
eprint={0707.0476},
... | jindal2007fractional |
arxiv-655 | 0707.0479 | Precoding for the AWGN Channel with Discrete Interference | <|reference_start|>Precoding for the AWGN Channel with Discrete Interference: For a state-dependent DMC with input alphabet $\mathcal{X}$ and state alphabet $\mathcal{S}$ where the i.i.d. state sequence is known causally at the transmitter, it is shown that by using at most $|\mathcal{X}||\mathcal{S}|-|\mathcal{S}|+1$ ... | arxiv | @article{farmanbar2007precoding,
title={Precoding for the AWGN Channel with Discrete Interference},
author={Hamidreza Farmanbar and Amir K. Khandani},
journal={arXiv preprint arXiv:0707.0479},
year={2007},
number={UW-ECE-2006-24},
archivePrefix={arXiv},
eprint={0707.0479},
primaryClass={... | farmanbar2007precoding |
arxiv-656 | 0707.0498 | The Role of Time in the Creation of Knowledge | <|reference_start|>The Role of Time in the Creation of Knowledge: This paper I assume that in humans the creation of knowledge depends on a discrete time, or stage, sequential decision-making process subjected to a stochastic, information transmitting environment. For each time-stage, this environment randomly transmit... | arxiv | @article{murphy2007the,
title={The Role of Time in the Creation of Knowledge},
author={Roy E. Murphy},
journal={arXiv preprint arXiv:0707.0498},
year={2007},
archivePrefix={arXiv},
eprint={0707.0498},
primaryClass={cs.LG cs.AI cs.IT math.IT}
} | murphy2007the |
arxiv-657 | 0707.0500 | Location-Aided Fast Distributed Consensus in Wireless Networks | <|reference_start|>Location-Aided Fast Distributed Consensus in Wireless Networks: Existing works on distributed consensus explore linear iterations based on reversible Markov chains, which contribute to the slow convergence of the algorithms. It has been observed that by overcoming the diffusive behavior of reversible... | arxiv | @article{li2007location-aided,
title={Location-Aided Fast Distributed Consensus in Wireless Networks},
author={Wenjun Li, Yanbing Zhang and Huaiyu Dai},
journal={arXiv preprint arXiv:0707.0500},
year={2007},
doi={10.1109/TIT.2010.2081030},
archivePrefix={arXiv},
eprint={0707.0500},
prima... | li2007location-aided |
arxiv-658 | 0707.0514 | Phase space methods and psychoacoustic models in lossy transform coding | <|reference_start|>Phase space methods and psychoacoustic models in lossy transform coding: I present a method for lossy transform coding of digital audio that uses the Weyl symbol calculus for constructing the encoding and decoding transformation. The method establishes a direct connection between a time-frequency rep... | arxiv | @article{cargo2007phase,
title={Phase space methods and psychoacoustic models in lossy transform coding},
author={Matthew Charles Cargo},
journal={arXiv preprint arXiv:0707.0514},
year={2007},
archivePrefix={arXiv},
eprint={0707.0514},
primaryClass={cs.IT cs.SD math.IT}
} | cargo2007phase |
arxiv-659 | 0707.0546 | Weighted Popular Matchings | <|reference_start|>Weighted Popular Matchings: We study the problem of assigning jobs to applicants. Each applicant has a weight and provides a preference list ranking a subset of the jobs. A matching M is popular if there is no other matching M' such that the weight of the applicants who prefer M' over M exceeds the w... | arxiv | @article{mestre2007weighted,
title={Weighted Popular Matchings},
author={Juli'an Mestre},
journal={arXiv preprint arXiv:0707.0546},
year={2007},
archivePrefix={arXiv},
eprint={0707.0546},
primaryClass={cs.DS}
} | mestre2007weighted |
arxiv-660 | 0707.0548 | From Royal Road to Epistatic Road for Variable Length Evolution Algorithm | <|reference_start|>From Royal Road to Epistatic Road for Variable Length Evolution Algorithm: Although there are some real world applications where the use of variable length representation (VLR) in Evolutionary Algorithm is natural and suitable, an academic framework is lacking for such representations. In this work w... | arxiv | @article{platel2007from,
title={From Royal Road to Epistatic Road for Variable Length Evolution
Algorithm},
author={Michael Defoin Platel (I3S), Sebastien Verel (I3S), Manuel Clergue
(I3S), Philippe Collard (I3S)},
journal={Lecture notes in computer science (Lect. notes comput. sci.) ISSN
0302-9743 (2... | platel2007from |
arxiv-661 | 0707.0556 | Determinacy in a synchronous pi-calculus | <|reference_start|>Determinacy in a synchronous pi-calculus: The S-pi-calculus is a synchronous pi-calculus which is based on the SL model. The latter is a relaxation of the Esterel model where the reaction to the absence of a signal within an instant can only happen at the next instant. In the present work, we present... | arxiv | @article{amadio2007determinacy,
title={Determinacy in a synchronous pi-calculus},
author={Roberto Amadio (PPS), Mehdi Dogguy (PPS)},
journal={From semantics to computer science: essays in honor of Gilles
Kahn, Y. Bertot et al. (Ed.) (2009) 1-27},
year={2007},
archivePrefix={arXiv},
eprint={070... | amadio2007determinacy |
arxiv-662 | 0707.0562 | On a Non-Context-Free Extension of PDL | <|reference_start|>On a Non-Context-Free Extension of PDL: Over the last 25 years, a lot of work has been done on seeking for decidable non-regular extensions of Propositional Dynamic Logic (PDL). Only recently, an expressive extension of PDL, allowing visibly pushdown automata (VPAs) as a formalism to describe program... | arxiv | @article{göller2007on,
title={On a Non-Context-Free Extension of PDL},
author={Stefan G"oller and Dirk Nowotka},
journal={arXiv preprint arXiv:0707.0562},
year={2007},
archivePrefix={arXiv},
eprint={0707.0562},
primaryClass={cs.LO}
} | göller2007on |
arxiv-663 | 0707.0568 | Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems based on Game Theory-Part I: Nash Equilibria | <|reference_start|>Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems based on Game Theory-Part I: Nash Equilibria: In this two-parts paper we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-multip... | arxiv | @article{scutari2007optimal,
title={Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems
based on Game Theory-Part I: Nash Equilibria},
author={Gesualdo Scutari, D.P. Palomar, S. Barbarossa},
journal={arXiv preprint arXiv:0707.0568},
year={2007},
doi={10.1109/TSP.2007.907807},
... | scutari2007optimal |
arxiv-664 | 0707.0610 | Unfolding Orthogonal Terrains | <|reference_start|>Unfolding Orthogonal Terrains: It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece by cutting along grid edges def... | arxiv | @article{o'rourke2007unfolding,
title={Unfolding Orthogonal Terrains},
author={Joseph O'Rourke},
journal={arXiv preprint arXiv:0707.0610},
year={2007},
number={Smith Technical Report 084},
archivePrefix={arXiv},
eprint={0707.0610},
primaryClass={cs.CG}
} | o'rourke2007unfolding |
arxiv-665 | 0707.0641 | Where are Bottlenecks in NK Fitness Landscapes? | <|reference_start|>Where are Bottlenecks in NK Fitness Landscapes?: Usually the offspring-parent fitness correlation is used to visualize and analyze some caracteristics of fitness landscapes such as evolvability. In this paper, we introduce a more general representation of this correlation, the Fitness Cloud (FC). We ... | arxiv | @article{verel2007where,
title={Where are Bottlenecks in NK Fitness Landscapes?},
author={S'ebastien Verel (I3S), Philippe Collard (I3S), Manuel Clergue (I3S)},
journal={Evolutionary Computation, 2003. CEC'03 (08/12/2003) 273--280},
year={2007},
doi={10.1109/CEC.2003.1299585},
archivePrefix={arX... | verel2007where |
arxiv-666 | 0707.0643 | Scuba Search : when selection meets innovation | <|reference_start|>Scuba Search : when selection meets innovation: We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality in fitness landscape. Despite the fact that natural evolution does not directly select for evolvabi... | arxiv | @article{verel2007scuba,
title={Scuba Search : when selection meets innovation},
author={S'ebastien Verel (I3S), Philippe Collard (I3S), Manuel Clergue (I3S)},
journal={Evolutionary Computation, 2004. CEC2004 (23/06/2004) 924 - 931},
year={2007},
doi={10.1109/CEC.2004.1330960},
archivePrefix={ar... | verel2007scuba |
arxiv-667 | 0707.0644 | Another view of the Gaussian algorithm | <|reference_start|>Another view of the Gaussian algorithm: We introduce here a rewrite system in the group of unimodular matrices, \emph{i.e.}, matrices with integer entries and with determinant equal to $\pm 1$. We use this rewrite system to precisely characterize the mechanism of the Gaussian algorithm, that finds sh... | arxiv | @article{akhavi2007another,
title={Another view of the Gaussian algorithm},
author={Ali Akhavi (GREYC), C'eline Moreira (GREYC)},
journal={Proceedings of Latin'04 (04/2004) 474--487},
year={2007},
archivePrefix={arXiv},
eprint={0707.0644},
primaryClass={cs.DS cs.DM}
} | akhavi2007another |
arxiv-668 | 0707.0648 | Dial a Ride from k-forest | <|reference_start|>Dial a Ride from k-forest: The k-forest problem is a common generalization of both the k-MST and the dense-$k$-subgraph problems. Formally, given a metric space on $n$ vertices $V$, with $m$ demand pairs $\subseteq V \times V$ and a ``target'' $k\le m$, the goal is to find a minimum cost subgraph tha... | arxiv | @article{gupta2007dial,
title={Dial a Ride from k-forest},
author={Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi},
journal={arXiv preprint arXiv:0707.0648},
year={2007},
archivePrefix={arXiv},
eprint={0707.0648},
primaryClass={cs.DS}
} | gupta2007dial |
arxiv-669 | 0707.0649 | Sphere Lower Bound for Rotated Lattice Constellations in Fading Channels | <|reference_start|>Sphere Lower Bound for Rotated Lattice Constellations in Fading Channels: We study the error probability performance of rotated lattice constellations in frequency-flat Nakagami-$m$ block-fading channels. In particular, we use the sphere lower bound on the underlying infinite lattice as a performance... | arxiv | @article{fabregas2007sphere,
title={Sphere Lower Bound for Rotated Lattice Constellations in Fading Channels},
author={Albert Guillen i Fabregas and Emanuele Viterbo},
journal={arXiv preprint arXiv:0707.0649},
year={2007},
archivePrefix={arXiv},
eprint={0707.0649},
primaryClass={cs.IT math.I... | fabregas2007sphere |
arxiv-670 | 0707.0652 | How to use the Scuba Diving metaphor to solve problem with neutrality ? | <|reference_start|>How to use the Scuba Diving metaphor to solve problem with neutrality ?: We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in many real-world problems. Despite the fact that natural ev... | arxiv | @article{collard2007how,
title={How to use the Scuba Diving metaphor to solve problem with neutrality ?},
author={Philippe Collard (I3S), S'ebastien Verel (I3S), Manuel Clergue (I3S)},
journal={ECAI'2004 (27/08/2004) 166-170},
year={2007},
archivePrefix={arXiv},
eprint={0707.0652},
primaryCl... | collard2007how |
arxiv-671 | 0707.0701 | Clustering and Feature Selection using Sparse Principal Component Analysis | <|reference_start|>Clustering and Feature Selection using Sparse Principal Component Analysis: In this paper, we study the application of sparse principal component analysis (PCA) to clustering and feature selection problems. Sparse PCA seeks sparse factors, or linear combinations of the data variables, explaining a ma... | arxiv | @article{luss2007clustering,
title={Clustering and Feature Selection using Sparse Principal Component
Analysis},
author={Ronny Luss, Alexandre d'Aspremont},
journal={arXiv preprint arXiv:0707.0701},
year={2007},
archivePrefix={arXiv},
eprint={0707.0701},
primaryClass={cs.AI cs.LG cs.MS}
} | luss2007clustering |
arxiv-672 | 0707.0704 | Model Selection Through Sparse Maximum Likelihood Estimation | <|reference_start|>Model Selection Through Sparse Maximum Likelihood Estimation: We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to solve a maximum likelihood problem with an added l_1-norm p... | arxiv | @article{banerjee2007model,
title={Model Selection Through Sparse Maximum Likelihood Estimation},
author={Onureena Banerjee, Laurent El Ghaoui, Alexandre d'Aspremont},
journal={arXiv preprint arXiv:0707.0704},
year={2007},
archivePrefix={arXiv},
eprint={0707.0704},
primaryClass={cs.AI cs.LG}... | banerjee2007model |
arxiv-673 | 0707.0705 | Optimal Solutions for Sparse Principal Component Analysis | <|reference_start|>Optimal Solutions for Sparse Principal Component Analysis: Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonzero coefficients in this combination. This is known as sparse pr... | arxiv | @article{d'aspremont2007optimal,
title={Optimal Solutions for Sparse Principal Component Analysis},
author={Alexandre d'Aspremont, Francis Bach, Laurent El Ghaoui},
journal={arXiv preprint arXiv:0707.0705},
year={2007},
archivePrefix={arXiv},
eprint={0707.0705},
primaryClass={cs.AI cs.LG}
} | d'aspremont2007optimal |
arxiv-674 | 0707.0724 | Workspace Analysis of the Parallel Module of the VERNE Machine | <|reference_start|>Workspace Analysis of the Parallel Module of the VERNE Machine: The paper addresses geometric aspects of a spatial three-degree-of-freedom parallel module, which is the parallel module of a hybrid serial-parallel 5-axis machine tool. This parallel module consists of a moving platform that is connecte... | arxiv | @article{kanaan2007workspace,
title={Workspace Analysis of the Parallel Module of the VERNE Machine},
author={Daniel Kanaan (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
(IRCCyN)},
journal={Problems of Mechanics 25, 4 (01/12/2006) 26-42},
year={2007},
archivePrefix={arXiv},
eprint={0707.0... | kanaan2007workspace |
arxiv-675 | 0707.0740 | A Multi Interface Grid Discovery System | <|reference_start|>A Multi Interface Grid Discovery System: Discovery Systems (DS) can be considered as entry points for global loosely coupled distributed systems. An efficient Discovery System in essence increases the performance, reliability and decision making capability of distributed systems. With the rapid incre... | arxiv | @article{ali2007a,
title={A Multi Interface Grid Discovery System},
author={A. Ali, A. Anjum, J. Bunn, F. Khan, R.McClatchey, H. Newman, C.
Steenberg, M. Thomas, Ian Willers},
journal={arXiv preprint arXiv:0707.0740},
year={2007},
archivePrefix={arXiv},
eprint={0707.0740},
primaryClass={cs... | ali2007a |
arxiv-676 | 0707.0742 | Mobile Computing in Physics Analysis - An Indicator for eScience | <|reference_start|>Mobile Computing in Physics Analysis - An Indicator for eScience: This paper presents the design and implementation of a Grid-enabled physics analysis environment for handheld and other resource-limited computing devices as one example of the use of mobile devices in eScience. Handheld devices offer ... | arxiv | @article{ali2007mobile,
title={Mobile Computing in Physics Analysis - An Indicator for eScience},
author={A. Ali, A. Anjum, T. Azim, J. Bunn, A. Ikram, R. McClatchey, H.
Newman, C. Steenberg, M. Thomas, I. Willers},
journal={arXiv preprint arXiv:0707.0742},
year={2007},
archivePrefix={arXiv},
... | ali2007mobile |
arxiv-677 | 0707.0743 | DIANA Scheduling Hierarchies for Optimizing Bulk Job Scheduling | <|reference_start|>DIANA Scheduling Hierarchies for Optimizing Bulk Job Scheduling: The use of meta-schedulers for resource management in large-scale distributed systems often leads to a hierarchy of schedulers. In this paper, we discuss why existing meta-scheduling hierarchies are sometimes not sufficient for Grid sys... | arxiv | @article{anjum2007diana,
title={DIANA Scheduling Hierarchies for Optimizing Bulk Job Scheduling},
author={A. Anjum, R. McClatchey, H. Stockinger, A. Ali, I. Willers, M. Thomas,
M. Sagheer, K. Hasham, O. Alvi},
journal={arXiv preprint arXiv:0707.0743},
year={2007},
doi={10.1109/E-SCIENCE.2006.26117... | anjum2007diana |
arxiv-678 | 0707.0744 | A process algebra based framework for promise theory | <|reference_start|>A process algebra based framework for promise theory: We present a process algebra based approach to formalize the interactions of computing devices such as the representation of policies and the resolution of conflicts. As an example we specify how promises may be used in coming to an agreement rega... | arxiv | @article{bergstra2007a,
title={A process algebra based framework for promise theory},
author={Jan Bergstra, Inge Bethke and Mark Burgess},
journal={arXiv preprint arXiv:0707.0744},
year={2007},
number={PRG0701},
archivePrefix={arXiv},
eprint={0707.0744},
primaryClass={cs.LO}
} | bergstra2007a |
arxiv-679 | 0707.0745 | Semantic Information Retrieval from Distributed Heterogeneous Data Sources | <|reference_start|>Semantic Information Retrieval from Distributed Heterogeneous Data Sources: Information retrieval from distributed heterogeneous data sources remains a challenging issue. As the number of data sources increases more intelligent retrieval techniques, focusing on information content and semantics, are ... | arxiv | @article{munir2007semantic,
title={Semantic Information Retrieval from Distributed Heterogeneous Data
Sources},
author={K. Munir, M. Odeh, R. McClatchey, S. Khan, I. Habib},
journal={arXiv preprint arXiv:0707.0745},
year={2007},
archivePrefix={arXiv},
eprint={0707.0745},
primaryClass={cs.D... | munir2007semantic |
arxiv-680 | 0707.0748 | Experiences of Engineering Grid-Based Medical Software | <|reference_start|>Experiences of Engineering Grid-Based Medical Software: Objectives: Grid-based technologies are emerging as potential solutions for managing and collaborating distributed resources in the biomedical domain. Few examples exist, however, of successful implementations of Grid-enabled medical systems and... | arxiv | @article{estrella2007experiences,
title={Experiences of Engineering Grid-Based Medical Software},
author={F. Estrella, T. Hauer, R. McClatchey, M. Odeh, D Rogulin, T.
Solomonides},
journal={arXiv preprint arXiv:0707.0748},
year={2007},
archivePrefix={arXiv},
eprint={0707.0748},
primaryClas... | estrella2007experiences |
arxiv-681 | 0707.0761 | Managing Separation of Concerns in Grid Applications Through Architectural Model Transformations | <|reference_start|>Managing Separation of Concerns in Grid Applications Through Architectural Model Transformations: Grids enable the aggregation, virtualization and sharing of massive heterogeneous and geographically dispersed resources, using files, applications and storage devices, to solve computation and data inte... | arxiv | @article{manset2007managing,
title={Managing Separation of Concerns in Grid Applications Through
Architectural Model Transformations},
author={David Manset, Herve Verjus, Richard McClatchey},
journal={arXiv preprint arXiv:0707.0761},
year={2007},
archivePrefix={arXiv},
eprint={0707.0761},
... | manset2007managing |
arxiv-682 | 0707.0762 | PhantomOS: A Next Generation Grid Operating System | <|reference_start|>PhantomOS: A Next Generation Grid Operating System: Grid Computing has made substantial advances in the past decade; these are primarily due to the adoption of standardized Grid middleware. However Grid computing has not yet become pervasive because of some barriers that we believe have been caused b... | arxiv | @article{habib2007phantomos:,
title={PhantomOS: A Next Generation Grid Operating System},
author={Irfan Habib, Kamran Soomro, Ashiq Anjum, Richard McClatchey, Arshad
Ali, Peter Bloodsworth},
journal={arXiv preprint arXiv:0707.0762},
year={2007},
archivePrefix={arXiv},
eprint={0707.0762},
p... | habib2007phantomos: |
arxiv-683 | 0707.0763 | The Requirements for Ontologies in Medical Data Integration: A Case Study | <|reference_start|>The Requirements for Ontologies in Medical Data Integration: A Case Study: Evidence-based medicine is critically dependent on three sources of information: a medical knowledge base, the patients medical record and knowledge of available resources, including where appropriate, clinical protocols. Pati... | arxiv | @article{anjum2007the,
title={The Requirements for Ontologies in Medical Data Integration: A Case
Study},
author={Ashiq Anjum, Peter Bloodsworth, Andrew Branson, Tamas Hauer, Richard
McClatchey, Kamran Munir, Dmitry Rogulin, Jetendr Shamdasani},
journal={arXiv preprint arXiv:0707.0763},
year={2007},... | anjum2007the |
arxiv-684 | 0707.0764 | p-Adic Degeneracy of the Genetic Code | <|reference_start|>p-Adic Degeneracy of the Genetic Code: Degeneracy of the genetic code is a biological way to minimize effects of the undesirable mutation changes. Degeneration has a natural description on the 5-adic space of 64 codons $\mathcal{C}_5 (64) = \{n_0 + n_1 5 + n_2 5^2 : n_i = 1, 2, 3, 4 \} ,$ where $n_... | arxiv | @article{dragovich2007p-adic,
title={p-Adic Degeneracy of the Genetic Code},
author={Branko Dragovich and Alexandra Dragovich},
journal={SFIN XX A1 (2007) 179-188},
year={2007},
archivePrefix={arXiv},
eprint={0707.0764},
primaryClass={q-bio.GN cs.IT math.IT physics.bio-ph}
} | dragovich2007p-adic |
arxiv-685 | 0707.0785 | Garside monoids vs divisibility monoids | <|reference_start|>Garside monoids vs divisibility monoids: Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of common multiples) i... | arxiv | @article{picantin2007garside,
title={Garside monoids vs divisibility monoids},
author={Matthieu Picantin (LIAFA)},
journal={arXiv preprint arXiv:0707.0785},
year={2007},
archivePrefix={arXiv},
eprint={0707.0785},
primaryClass={math.GR cs.DM}
} | picantin2007garside |
arxiv-686 | 0707.0796 | Performance of Linear Field Reconstruction Techniques with Noise and Uncertain Sensor Locations | <|reference_start|>Performance of Linear Field Reconstruction Techniques with Noise and Uncertain Sensor Locations: We consider a wireless sensor network, sampling a bandlimited field, described by a limited number of harmonics. Sensor nodes are irregularly deployed over the area of interest or subject to random motion... | arxiv | @article{nordio2007performance,
title={Performance of Linear Field Reconstruction Techniques with Noise and
Uncertain Sensor Locations},
author={A. Nordio, C.-F. Chiasserini, E. Viterbo},
journal={arXiv preprint arXiv:0707.0796},
year={2007},
doi={10.1109/TSP.2008.924865},
archivePrefix={arXiv... | nordio2007performance |
arxiv-687 | 0707.0799 | A New Family of Unitary Space-Time Codes with a Fast Parallel Sphere Decoder Algorithm | <|reference_start|>A New Family of Unitary Space-Time Codes with a Fast Parallel Sphere Decoder Algorithm: In this paper we propose a new design criterion and a new class of unitary signal constellations for differential space-time modulation for multiple-antenna systems over Rayleigh flat-fading channels with unknown ... | arxiv | @article{chen2007a,
title={A New Family of Unitary Space-Time Codes with a Fast Parallel Sphere
Decoder Algorithm},
author={Xinjia Chen, Kemin Zhou and Jorge Aravena},
journal={IEEE Transactions on Information Theory, vol. 52, pp. 115-140,
January 2006},
year={2007},
archivePrefix={arXiv},
e... | chen2007a |
arxiv-688 | 0707.0802 | Very fast watermarking by reversible contrast mapping | <|reference_start|>Very fast watermarking by reversible contrast mapping: Reversible contrast mapping (RCM) is a simple integer transform that applies to pairs of pixels. For some pairs of pixels, RCM is invertible, even if the least significant bits (LSBs) of the transformed pixels are lost. The data space occupied by... | arxiv | @article{coltuc2007very,
title={Very fast watermarking by reversible contrast mapping},
author={Dinu Coltuc, Jean-Marc Chassery (GIPSA-lab)},
journal={IEEE Signal Processing Letters 14, 4 (04/2007) pp 255-258},
year={2007},
doi={10.1109/LSP.2006.884895},
archivePrefix={arXiv},
eprint={0707.0... | coltuc2007very |
arxiv-689 | 0707.0805 | A New Generalization of Chebyshev Inequality for Random Vectors | <|reference_start|>A New Generalization of Chebyshev Inequality for Random Vectors: In this article, we derive a new generalization of Chebyshev inequality for random vectors. We demonstrate that the new generalization is much less conservative than the classical generalization.<|reference_end|> | arxiv | @article{chen2007a,
title={A New Generalization of Chebyshev Inequality for Random Vectors},
author={Xinjia Chen},
journal={arXiv preprint arXiv:0707.0805},
year={2007},
archivePrefix={arXiv},
eprint={0707.0805},
primaryClass={math.ST cs.LG math.PR stat.AP stat.TH}
} | chen2007a |
arxiv-690 | 0707.0808 | The Cyborg Astrobiologist: Porting from a wearable computer to the Astrobiology Phone-cam | <|reference_start|>The Cyborg Astrobiologist: Porting from a wearable computer to the Astrobiology Phone-cam: We have used a simple camera phone to significantly improve an `exploration system' for astrobiology and geology. This camera phone will make it much easier to develop and test computer-vision algorithms for fu... | arxiv | @article{bartolo2007the,
title={The Cyborg Astrobiologist: Porting from a wearable computer to the
Astrobiology Phone-cam},
author={Alexandra Bartolo, Patrick C. McGuire, Kenneth P. Camilleri,
Christopher Spiteri, Jonathan C. Borg, Philip J. Farrugia, Jens Ormo, Javier
Gomez-Elvira, Jose Antonio Rodriguez... | bartolo2007the |
arxiv-691 | 0707.0860 | On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks | <|reference_start|>On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks: The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can significantly increase the overall throughput of wir... | arxiv | @article{rouayheb2007on,
title={On the Minimum Number of Transmissions in Single-Hop Wireless Coding
Networks},
author={Salim Y. El Rouayheb, Mohammad Asad R. Chaudhry, and Alex Sprintson},
journal={arXiv preprint arXiv:0707.0860},
year={2007},
archivePrefix={arXiv},
eprint={0707.0860},
pr... | rouayheb2007on |
arxiv-692 | 0707.0862 | Scheduling in Data Intensive and Network Aware (DIANA) Grid Environments | <|reference_start|>Scheduling in Data Intensive and Network Aware (DIANA) Grid Environments: In Grids scheduling decisions are often made on the basis of jobs being either data or computation intensive: in data intensive situations jobs may be pushed to the data and in computation intensive situations data may be pulle... | arxiv | @article{mcclatchey2007scheduling,
title={Scheduling in Data Intensive and Network Aware (DIANA) Grid Environments},
author={Richard McClatchey, Ashiq Anjum, Heinz Stockinger, Arshad Ali, Ian
Willers, Michael Thomas},
journal={arXiv preprint arXiv:0707.0862},
year={2007},
archivePrefix={arXiv},
... | mcclatchey2007scheduling |
arxiv-693 | 0707.0871 | Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems based on Game Theory-Part II: Algorithms | <|reference_start|>Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems based on Game Theory-Part II: Algorithms: In this two-part paper, we address the problem of finding the optimal precoding/multiplexing scheme for a set of non-cooperative links sharing the same physical resources, e.g., time and... | arxiv | @article{scutari2007optimal,
title={Optimal Linear Precoding Strategies for Wideband Non-Cooperative Systems
based on Game Theory-Part II: Algorithms},
author={Gesualdo Scutari, Daniel P. Palomar, and Sergio Barbarossa},
journal={arXiv preprint arXiv:0707.0871},
year={2007},
doi={10.1109/TSP.2007.... | scutari2007optimal |
arxiv-694 | 0707.0878 | Risk Analysis in Robust Control -- Making the Case for Probabilistic Robust Control | <|reference_start|>Risk Analysis in Robust Control -- Making the Case for Probabilistic Robust Control: This paper offers a critical view of the "worst-case" approach that is the cornerstone of robust control design. It is our contention that a blind acceptance of worst-case scenarios may lead to designs that are actua... | arxiv | @article{chen2007risk,
title={Risk Analysis in Robust Control -- Making the Case for Probabilistic
Robust Control},
author={Xinjia Chen, Jorge Aravena and Kemin Zhou},
journal={Proceedings of American Control Conference, pp. 1533-1538,
Portland, June 2005.},
year={2007},
archivePrefix={arXiv},
... | chen2007risk |
arxiv-695 | 0707.0890 | Are there Hilbert-style Pure Type Systems? | <|reference_start|>Are there Hilbert-style Pure Type Systems?: For many a natural deduction style logic there is a Hilbert-style logic that is equivalent to it in that it has the same theorems (i.e. valid judgements with empty contexts). For intuitionistic logic, the axioms of the equivalent Hilbert-style logic can be ... | arxiv | @article{bunder2007are,
title={Are there Hilbert-style Pure Type Systems?},
author={M. W. Bunder and W. M. J.Dekkers},
journal={Logical Methods in Computer Science, Volume 4, Issue 1 (January 7,
2008) lmcs:839},
year={2007},
doi={10.2168/LMCS-4(1:1)2008},
archivePrefix={arXiv},
eprint={070... | bunder2007are |
arxiv-696 | 0707.0891 | The Nash Equilibrium Revisited: Chaos and Complexity Hidden in Simplicity | <|reference_start|>The Nash Equilibrium Revisited: Chaos and Complexity Hidden in Simplicity: The Nash Equilibrium is a much discussed, deceptively complex, method for the analysis of non-cooperative games. If one reads many of the commonly available definitions the description of the Nash Equilibrium is deceptively si... | arxiv | @article{fellman2007the,
title={The Nash Equilibrium Revisited: Chaos and Complexity Hidden in
Simplicity},
author={Philip V. Fellman},
journal={InterJournal Complex Systems, 1013, 2004.
http://www.interjournal.org/},
year={2007},
archivePrefix={arXiv},
eprint={0707.0891},
primaryClass={... | fellman2007the |
arxiv-697 | 0707.0895 | Segmentation and Context of Literary and Musical Sequences | <|reference_start|>Segmentation and Context of Literary and Musical Sequences: We test a segmentation algorithm, based on the calculation of the Jensen-Shannon divergence between probability distributions, to two symbolic sequences of literary and musical origin. The first sequence represents the successive appearance ... | arxiv | @article{zanette2007segmentation,
title={Segmentation and Context of Literary and Musical Sequences},
author={Damian H. Zanette},
journal={arXiv preprint arXiv:0707.0895},
year={2007},
archivePrefix={arXiv},
eprint={0707.0895},
primaryClass={cs.CL physics.data-an}
} | zanette2007segmentation |
arxiv-698 | 0707.0909 | Spectrum Sensing in Cognitive Radios Based on Multiple Cyclic Frequencies | <|reference_start|>Spectrum Sensing in Cognitive Radios Based on Multiple Cyclic Frequencies: Cognitive radios sense the radio spectrum in order to find unused frequency bands and use them in an agile manner. Transmission by the primary user must be detected reliably even in the low signal-to-noise ratio (SNR) regime a... | arxiv | @article{lundén2007spectrum,
title={Spectrum Sensing in Cognitive Radios Based on Multiple Cyclic
Frequencies},
author={Jarmo Lund'en, Visa Koivunen, Anu Huttunen, H. Vincent Poor},
journal={arXiv preprint arXiv:0707.0909},
year={2007},
archivePrefix={arXiv},
eprint={0707.0909},
primaryCla... | lundén2007spectrum |
arxiv-699 | 0707.0926 | Theorem proving support in programming language semantics | <|reference_start|>Theorem proving support in programming language semantics: We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational seman... | arxiv | @article{bertot2007theorem,
title={Theorem proving support in programming language semantics},
author={Yves Bertot (INRIA Sophia Antipolis)},
journal={arXiv preprint arXiv:0707.0926},
year={2007},
archivePrefix={arXiv},
eprint={0707.0926},
primaryClass={cs.LO cs.PL}
} | bertot2007theorem |
arxiv-700 | 0707.0969 | Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution | <|reference_start|>Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution: As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, for which lower and upper bounds on the capacity are derived. For the parallel relay channel with degraded subchanne... | arxiv | @article{liang2007resource,
title={Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution},
author={Yingbin Liang, Venugopal V. Veeravalli, H. Vincent Poor},
journal={arXiv preprint arXiv:0707.0969},
year={2007},
archivePrefix={arXiv},
eprint={0707.0969},
primaryClass={cs.I... | liang2007resource |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.