ScholarCopilot
Collection
4 items • Updated
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-1 | 0704.0002 | Sparsity-certifying Graph Decompositions | <|reference_start|>Sparsity-certifying Graph Decompositions: We describe a new algorithm, the $(k,\ell)$-pebble game with colors, and use it obtain a characterization of the family of $(k,\ell)$-sparse graphs and algorithmic solutions to a family of problems concerning tree decompositions of graphs. Special instances o... | arxiv | @article{streinu2007sparsity-certifying,
title={Sparsity-certifying Graph Decompositions},
author={Ileana Streinu and Louis Theran},
journal={arXiv preprint arXiv:0704.0002},
year={2007},
archivePrefix={arXiv},
eprint={0704.0002},
primaryClass={math.CO cs.CG}
} | streinu2007sparsity-certifying |
arxiv-2 | 0704.0046 | A limit relation for entropy and channel capacity per unit cost | <|reference_start|>A limit relation for entropy and channel capacity per unit cost: In a quantum mechanical model, Diosi, Feldmann and Kosloff arrived at a conjecture stating that the limit of the entropy of certain mixtures is the relative entropy as system size goes to infinity. The conjecture is proven in this paper... | arxiv | @article{csiszar2007a,
title={A limit relation for entropy and channel capacity per unit cost},
author={I. Csiszar, F. Hiai and D. Petz},
journal={J. Math. Phys. 48(2007), 092102.},
year={2007},
doi={10.1063/1.2779138},
archivePrefix={arXiv},
eprint={0704.0046},
primaryClass={quant-ph cs... | csiszar2007a |
arxiv-3 | 0704.0047 | Intelligent location of simultaneously active acoustic emission sources: Part I | <|reference_start|>Intelligent location of simultaneously active acoustic emission sources: Part I: The intelligent acoustic emission locator is described in Part I, while Part II discusses blind source separation, time delay estimation and location of two simultaneously active continuous acoustic emission sources. T... | arxiv | @article{kosel2007intelligent,
title={Intelligent location of simultaneously active acoustic emission sources:
Part I},
author={T. Kosel and I. Grabec},
journal={arXiv preprint arXiv:0704.0047},
year={2007},
archivePrefix={arXiv},
eprint={0704.0047},
primaryClass={cs.NE cs.AI}
} | kosel2007intelligent |
arxiv-4 | 0704.0050 | Intelligent location of simultaneously active acoustic emission sources: Part II | <|reference_start|>Intelligent location of simultaneously active acoustic emission sources: Part II: Part I describes an intelligent acoustic emission locator, while Part II discusses blind source separation, time delay estimation and location of two continuous acoustic emission sources. Acoustic emission (AE) analys... | arxiv | @article{kosel2007intelligent,
title={Intelligent location of simultaneously active acoustic emission sources:
Part II},
author={T. Kosel and I. Grabec},
journal={arXiv preprint arXiv:0704.0050},
year={2007},
archivePrefix={arXiv},
eprint={0704.0050},
primaryClass={cs.NE cs.AI}
} | kosel2007intelligent |
arxiv-5 | 0704.0062 | On-line Viterbi Algorithm and Its Relationship to Random Walks | <|reference_start|>On-line Viterbi Algorithm and Its Relationship to Random Walks: In this paper, we introduce the on-line Viterbi algorithm for decoding hidden Markov models (HMMs) in much smaller than linear space. Our analysis on two-state HMMs suggests that the expected maximum memory used to decode sequence of len... | arxiv | @article{šrámek2007on-line,
title={On-line Viterbi Algorithm and Its Relationship to Random Walks},
author={Rastislav v{S}r'amek, Brov{n}a Brejov'a, Tom'av{s} Vinav{r}},
journal={Algorithms in Bioinformatics: 7th International Workshop (WABI),
4645 volume of Lecture Notes in Computer Science, pp. 240-251,... | šrámek2007on-line |
arxiv-6 | 0704.0090 | Real Options for Project Schedules (ROPS) | <|reference_start|>Real Options for Project Schedules (ROPS): Real Options for Project Schedules (ROPS) has three recursive sampling/optimization shells. An outer Adaptive Simulated Annealing (ASA) optimization shell optimizes parameters of strategic Plans containing multiple Projects containing ordered Tasks. A middle... | arxiv | @article{ingber2007real,
title={Real Options for Project Schedules (ROPS)},
author={Lester Ingber},
journal={arXiv preprint arXiv:0704.0090},
year={2007},
number={Report 2007:ROPS},
archivePrefix={arXiv},
eprint={0704.0090},
primaryClass={cs.CE cond-mat.stat-mech cs.MS cs.NA physics.data... | ingber2007real |
arxiv-7 | 0704.0098 | Sparsely-spread CDMA - a statistical mechanics based analysis | <|reference_start|>Sparsely-spread CDMA - a statistical mechanics based analysis: Sparse Code Division Multiple Access (CDMA), a variation on the standard CDMA method in which the spreading (signature) matrix contains only a relatively small number of non-zero elements, is presented and analysed using methods of statis... | arxiv | @article{raymond2007sparsely-spread,
title={Sparsely-spread CDMA - a statistical mechanics based analysis},
author={Jack Raymond, David Saad},
journal={J. Phys. A: Math. Theor. 40 No 41 (12 October 2007) 12315-12333},
year={2007},
doi={10.1088/1751-8113/40/41/004},
archivePrefix={arXiv},
epr... | raymond2007sparsely-spread |
arxiv-8 | 0704.0108 | Reducing SAT to 2-SAT | <|reference_start|>Reducing SAT to 2-SAT: Description of a polynomial time reduction of SAT to 2-SAT of polynomial size.<|reference_end|> | arxiv | @article{gubin2007reducing,
title={Reducing SAT to 2-SAT},
author={Sergey Gubin},
journal={arXiv preprint arXiv:0704.0108},
year={2007},
archivePrefix={arXiv},
eprint={0704.0108},
primaryClass={cs.CC}
} | gubin2007reducing |
arxiv-9 | 0704.0213 | Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient | <|reference_start|>Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient: This article has been withdrawn because it has been merged with the earlier article GCT3 (arXiv: CS/0501076 [cs.CC]) in the series. The merged article is now available as: Geometric Complexit... | arxiv | @article{narayanan2007geometric,
title={Geometric Complexity Theory V: On deciding nonvanishing of a generalized
Littlewood-Richardson coefficient},
author={Ketan D. Mulmuley Hariharan Narayanan},
journal={arXiv preprint arXiv:0704.0213},
year={2007},
archivePrefix={arXiv},
eprint={0704.0213},... | narayanan2007geometric |
arxiv-10 | 0704.0217 | Capacity of a Multiple-Antenna Fading Channel with a Quantized Precoding Matrix | <|reference_start|>Capacity of a Multiple-Antenna Fading Channel with a Quantized Precoding Matrix: Given a multiple-input multiple-output (MIMO) channel, feedback from the receiver can be used to specify a transmit precoding matrix, which selectively activates the strongest channel modes. Here we analyze the performan... | arxiv | @article{santipach2007capacity,
title={Capacity of a Multiple-Antenna Fading Channel with a Quantized Precoding
Matrix},
author={Wiroonsak Santipach and Michael L. Honig},
journal={IEEE Trans. Inf. Theory, vol. 55, no. 3, pp. 1218--1234, March
2009},
year={2007},
doi={10.1109/TIT.2008.2011437},
... | santipach2007capacity |
arxiv-11 | 0704.0218 | On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases | <|reference_start|>On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases: In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynom... | arxiv | @article{pritykin2007on,
title={On Almost Periodicity Criteria for Morphic Sequences in Some Particular
Cases},
author={Yuri Pritykin},
journal={arXiv preprint arXiv:0704.0218},
year={2007},
archivePrefix={arXiv},
eprint={0704.0218},
primaryClass={cs.DM cs.LO}
} | pritykin2007on |
arxiv-12 | 0704.0229 | Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry | <|reference_start|>Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry: This article belongs to a series on geometric complexity theory (GCT), an approach to the P vs. NP and related problems through algebraic geometry and representatio... | arxiv | @article{mulmuley2007geometric,
title={Geometric Complexity Theory VI: the flip via saturated and positive
integer programming in representation theory and algebraic geometry},
author={Ketan D. Mulmuley},
journal={arXiv preprint arXiv:0704.0229},
year={2007},
archivePrefix={arXiv},
eprint={070... | mulmuley2007geometric |
arxiv-13 | 0704.0282 | On Punctured Pragmatic Space-Time Codes in Block Fading Channel | <|reference_start|>On Punctured Pragmatic Space-Time Codes in Block Fading Channel: This paper considers the use of punctured convolutional codes to obtain pragmatic space-time trellis codes over block-fading channel. We show that good performance can be achieved even when puncturation is adopted and that we can still ... | arxiv | @article{bandi2007on,
title={On Punctured Pragmatic Space-Time Codes in Block Fading Channel},
author={Samuele Bandi, Luca Stabellini, Andrea Conti and Velio Tralli},
journal={arXiv preprint arXiv:0704.0282},
year={2007},
archivePrefix={arXiv},
eprint={0704.0282},
primaryClass={cs.IT cs.CC m... | bandi2007on |
arxiv-14 | 0704.0301 | Differential Recursion and Differentially Algebraic Functions | <|reference_start|>Differential Recursion and Differentially Algebraic Functions: Moore introduced a class of real-valued "recursive" functions by analogy with Kleene's formulation of the standard recursive functions. While his concise definition inspired a new line of research on analog computation, it contains some t... | arxiv | @article{kawamura2007differential,
title={Differential Recursion and Differentially Algebraic Functions},
author={Akitoshi Kawamura},
journal={Revised and published in ACM Trans. Comput. Logic 10, Article 22,
2009, under the title "Differential Recursion".},
year={2007},
doi={10.1145/1507244.15072... | kawamura2007differential |
arxiv-15 | 0704.0304 | The World as Evolving Information | <|reference_start|>The World as Evolving Information: This paper discusses the benefits of describing the world as information, especially in the study of the evolution of life and cognition. Traditional studies encounter problems because it is difficult to describe life and cognition in terms of matter and energy, sin... | arxiv | @article{gershenson2007the,
title={The World as Evolving Information},
author={Carlos Gershenson},
journal={Minai, A., Braha, D., and Bar-Yam, Y., eds. Unifying Themes in
Complex Systems VII, pp. 100-115. Springer, Berlin Heidelberg, 2012},
year={2007},
doi={10.1007/978-3-642-18003-3_10},
arch... | gershenson2007the |
arxiv-16 | 0704.0309 | The Complexity of HCP in Digraps with Degree Bound Two | <|reference_start|>The Complexity of HCP in Digraps with Degree Bound Two: The Hamiltonian cycle problem (HCP) in digraphs D with degree bound two is solved by two mappings in this paper. The first bijection is between an incidence matrix C_{nm} of simple digraph and an incidence matrix F of balanced bipartite undirect... | arxiv | @article{zhu2007the,
title={The Complexity of HCP in Digraps with Degree Bound Two},
author={Guohun Zhu},
journal={arXiv preprint arXiv:0704.0309},
year={2007},
archivePrefix={arXiv},
eprint={0704.0309},
primaryClass={cs.CC cs.DM}
} | zhu2007the |
arxiv-17 | 0704.0361 | Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes | <|reference_start|>Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes: It has been observed that particular rate-1/2 partially systematic parallel concatenated convolutional codes (PCCCs) can achieve a lower error floor than that of their rate-1/3 parent codes. Nevertheless, good puncturing p... | arxiv | @article{chatzigeorgiou2007pseudo-random,
title={Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo
Codes},
author={Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Ian J. Wassell and
Rolando Carrasco},
journal={arXiv preprint arXiv:0704.0361},
year={2007},
doi={10.1109/ISIT.... | chatzigeorgiou2007pseudo-random |
arxiv-18 | 0704.0468 | Inapproximability of Maximum Weighted Edge Biclique and Its Applications | <|reference_start|>Inapproximability of Maximum Weighted Edge Biclique and Its Applications: Given a bipartite graph $G = (V_1,V_2,E)$ where edges take on {\it both} positive and negative weights from set $\mathcal{S}$, the {\it maximum weighted edge biclique} problem, or $\mathcal{S}$-MWEB for short, asks to find a bi... | arxiv | @article{tan2007inapproximability,
title={Inapproximability of Maximum Weighted Edge Biclique and Its Applications},
author={Jinsong Tan},
journal={LNCS 4978, TAMC 2008, pp 282-293},
year={2007},
archivePrefix={arXiv},
eprint={0704.0468},
primaryClass={cs.CC cs.DS}
} | tan2007inapproximability |
arxiv-19 | 0704.0492 | Refuting the Pseudo Attack on the REESSE1+ Cryptosystem | <|reference_start|>Refuting the Pseudo Attack on the REESSE1+ Cryptosystem: We illustrate through example 1 and 2 that the condition at theorem 1 in [8] dissatisfies necessity, and the converse proposition of fact 1.1 in [8] does not hold, namely the condition Z/M - L/Ak < 1/(2 Ak^2) is not sufficient for f(i) + f(j) =... | arxiv | @article{su2007refuting,
title={Refuting the Pseudo Attack on the REESSE1+ Cryptosystem},
author={Shenghui Su, and Shuwang Lu},
journal={arXiv preprint arXiv:0704.0492},
year={2007},
archivePrefix={arXiv},
eprint={0704.0492},
primaryClass={cs.CR}
} | su2007refuting |
arxiv-20 | 0704.0499 | Optimal Routing for Decode-and-Forward based Cooperation in Wireless Networks | <|reference_start|>Optimal Routing for Decode-and-Forward based Cooperation in Wireless Networks: We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source single-destination network with many relay nodes. Gi... | arxiv | @article{ong2007optimal,
title={Optimal Routing for Decode-and-Forward based Cooperation in Wireless
Networks},
author={Lawrence Ong and Mehul Motani},
journal={Proceedings of the 4th Annual IEEE Communications Society
Conference on Sensor, Mesh, and Ad Hoc Communications and Networks (SECON
2007), Sa... | ong2007optimal |
arxiv-21 | 0704.0528 | Many-to-One Throughput Capacity of IEEE 80211 Multi-hop Wireless Networks | <|reference_start|>Many-to-One Throughput Capacity of IEEE 80211 Multi-hop Wireless Networks: This paper investigates the many-to-one throughput capacity (and by symmetry, one-to-many throughput capacity) of IEEE 802.11 multi-hop networks. It has generally been assumed in prior studies that the many-to-one throughput c... | arxiv | @article{chan2007many-to-one,
title={Many-to-One Throughput Capacity of IEEE 802.11 Multi-hop Wireless
Networks},
author={Chi Pan Chan, Soung Chang Liew, An Chan},
journal={arXiv preprint arXiv:0704.0528},
year={2007},
archivePrefix={arXiv},
eprint={0704.0528},
primaryClass={cs.NI cs.IT ma... | chan2007many-to-one |
arxiv-22 | 0704.0540 | On the Achievable Rate Regions for Interference Channels with Degraded Message Sets | <|reference_start|>On the Achievable Rate Regions for Interference Channels with Degraded Message Sets: The interference channel with degraded message sets (IC-DMS) refers to a communication model in which two senders attempt to communicate with their respective receivers simultaneously through a common medium, and one... | arxiv | @article{jiang2007on,
title={On the Achievable Rate Regions for Interference Channels with Degraded
Message Sets},
author={Jinhua Jiang and Xin Yan},
journal={arXiv preprint arXiv:0704.0540},
year={2007},
archivePrefix={arXiv},
eprint={0704.0540},
primaryClass={cs.IT math.IT}
} | jiang2007on |
arxiv-23 | 0704.0590 | A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes | <|reference_start|>A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes: We present an algorithm for systematic encoding of Hermitian codes. For a Hermitian code defined over GF(q^2), the proposed algorithm achieves a run time complexity of O(q^2) and is suitable for VLSI implementatio... | arxiv | @article{agarwal2007a,
title={A Low Complexity Algorithm and Architecture for Systematic Encoding of
Hermitian Codes},
author={Rachit Agarwal, Ralf Koetter and Emanuel Popovici},
journal={arXiv preprint arXiv:0704.0590},
year={2007},
doi={10.1109/ISIT.2007.4557408},
archivePrefix={arXiv},
... | agarwal2007a |
arxiv-24 | 0704.0671 | Learning from compressed observations | <|reference_start|>Learning from compressed observations: The problem of statistical learning is to construct a predictor of a random variable $Y$ as a function of a related random variable $X$ on the basis of an i.i.d. training sample from the joint distribution of $(X,Y)$. Allowable predictors are drawn from some spe... | arxiv | @article{raginsky2007learning,
title={Learning from compressed observations},
author={Maxim Raginsky},
journal={arXiv preprint arXiv:0704.0671},
year={2007},
doi={10.1109/ITW.2007.4313111},
archivePrefix={arXiv},
eprint={0704.0671},
primaryClass={cs.IT cs.LG math.IT}
} | raginsky2007learning |
arxiv-25 | 0704.0730 | Revisiting the Issues On Netflow Sample and Export Performance | <|reference_start|>Revisiting the Issues On Netflow Sample and Export Performance: The high volume of packets and packet rates of traffic on some router links makes it exceedingly difficult for routers to examine every packet in order to keep detailed statistics about the traffic which is traversing the router. Samplin... | arxiv | @article{haddadi2007revisiting,
title={Revisiting the Issues On Netflow Sample and Export Performance},
author={Hamed Haddadi, Raul Landa, Miguel Rio, Saleem Bhatti},
journal={arXiv preprint arXiv:0704.0730},
year={2007},
archivePrefix={arXiv},
eprint={0704.0730},
primaryClass={cs.PF cs.NI}
... | haddadi2007revisiting |
arxiv-26 | 0704.0788 | Optimal Synthesis of Multiple Algorithms | <|reference_start|>Optimal Synthesis of Multiple Algorithms: In this paper we give a definition of "algorithm," "finite algorithm," "equivalent algorithms," and what it means for a single algorithm to dominate a set of algorithms. We define a derived algorithm which may have a smaller mean execution time than any of it... | arxiv | @article{soileau2007optimal,
title={Optimal Synthesis of Multiple Algorithms},
author={Kerry M. Soileau},
journal={arXiv preprint arXiv:0704.0788},
year={2007},
archivePrefix={arXiv},
eprint={0704.0788},
primaryClass={cs.DS cs.PF}
} | soileau2007optimal |
arxiv-27 | 0704.0802 | Hybrid-ARQ in Multihop Networks with Opportunistic Relay Selection | <|reference_start|>Hybrid-ARQ in Multihop Networks with Opportunistic Relay Selection: This paper develops a contention-based opportunistic feedback technique towards relay selection in a dense wireless network. This technique enables the forwarding of additional parity information from the selected relay to the destin... | arxiv | @article{lo2007hybrid-arq,
title={Hybrid-ARQ in Multihop Networks with Opportunistic Relay Selection},
author={Caleb K. Lo, Robert W. Heath, Jr. and Sriram Vishwanath},
journal={arXiv preprint arXiv:0704.0802},
year={2007},
archivePrefix={arXiv},
eprint={0704.0802},
primaryClass={cs.IT math.... | lo2007hybrid-arq |
arxiv-28 | 0704.0805 | Opportunistic Relay Selection with Limited Feedback | <|reference_start|>Opportunistic Relay Selection with Limited Feedback: It has been shown that a decentralized relay selection protocol based on opportunistic feedback from the relays yields good throughput performance in dense wireless networks. This selection strategy supports a hybrid-ARQ transmission approach where... | arxiv | @article{lo2007opportunistic,
title={Opportunistic Relay Selection with Limited Feedback},
author={Caleb K. Lo, Robert W. Heath, Jr. and Sriram Vishwanath},
journal={arXiv preprint arXiv:0704.0805},
year={2007},
doi={10.1109/VETECS.2007.40},
archivePrefix={arXiv},
eprint={0704.0805},
pri... | lo2007opportunistic |
arxiv-29 | 0704.0831 | On packet lengths and overhead for random linear coding over the erasure channel | <|reference_start|>On packet lengths and overhead for random linear coding over the erasure channel: We assess the practicality of random network coding by illuminating the issue of overhead and considering it in conjunction with increasingly long packets sent over the erasure channel. We show that the transmission of ... | arxiv | @article{shrader2007on,
title={On packet lengths and overhead for random linear coding over the erasure
channel},
author={Brooke Shrader and Anthony Ephremides},
journal={arXiv preprint arXiv:0704.0831},
year={2007},
archivePrefix={arXiv},
eprint={0704.0831},
primaryClass={cs.IT math.IT}
} | shrader2007on |
arxiv-30 | 0704.0834 | P-adic arithmetic coding | <|reference_start|>P-adic arithmetic coding: A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer and incrementally reconstructs a seq... | arxiv | @article{rodionov2007p-adic,
title={P-adic arithmetic coding},
author={Anatoly Rodionov, Sergey Volkov},
journal={arXiv preprint arXiv:0704.0834},
year={2007},
archivePrefix={arXiv},
eprint={0704.0834},
primaryClass={cs.DS}
} | rodionov2007p-adic |
arxiv-31 | 0704.0838 | Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions | <|reference_start|>Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions: We study universal compression of sequences generated by monotonic distributions. We show that for a monotonic distribution over an alphabet of size $k$, each probability parameter costs essentially $0.5 \log (n/k^3)$ bi... | arxiv | @article{shamir2007universal,
title={Universal Source Coding for Monotonic and Fast Decaying Monotonic
Distributions},
author={Gil I. Shamir},
journal={arXiv preprint arXiv:0704.0838},
year={2007},
archivePrefix={arXiv},
eprint={0704.0838},
primaryClass={cs.IT math.IT}
} | shamir2007universal |
arxiv-32 | 0704.0858 | Lessons Learned from the deployment of a high-interaction honeypot | <|reference_start|>Lessons Learned from the deployment of a high-interaction honeypot: This paper presents an experimental study and the lessons learned from the observation of the attackers when logged on a compromised machine. The results are based on a six months period during which a controlled experiment has been ... | arxiv | @article{alata2007lessons,
title={Lessons Learned from the deployment of a high-interaction honeypot},
author={Eric Alata (LAAS), Vincent Nicomette (LAAS), Mohamed Ka^aniche
(LAAS), Marc Dacier (LAAS), Matthieu Herrb (LAAS)},
journal={Proc. 6th European Dependable Computing Conference (EDCC-6),
Coimbra ... | alata2007lessons |
arxiv-33 | 0704.0860 | Availability assessment of SunOS/Solaris Unix Systems based on Syslogd and wtmpx logfiles : a case study | <|reference_start|>Availability assessment of SunOS/Solaris Unix Systems based on Syslogd and wtmpx logfiles : a case study: This paper presents a measurement-based availability assessment study using field data collected during a 4-year period from 373 SunOS/Solaris Unix workstations and servers interconnected through... | arxiv | @article{simache2007availability,
title={Availability assessment of SunOS/Solaris Unix Systems based on Syslogd
and wtmpx logfiles : a case study},
author={Cristina Simache (LAAS), Mohamed Kaaniche (LAAS)},
journal={Proc. 2005 IEEE Pacific Rim International Symposium on Dependable
Computing (PRDC'2005),... | simache2007availability |
arxiv-34 | 0704.0861 | Empirical analysis and statistical modeling of attack processes based on honeypots | <|reference_start|>Empirical analysis and statistical modeling of attack processes based on honeypots: Honeypots are more and more used to collect data on malicious activities on the Internet and to better understand the strategies and techniques used by attackers to compromise target systems. Analysis and modeling met... | arxiv | @article{kaaniche2007empirical,
title={Empirical analysis and statistical modeling of attack processes based on
honeypots},
author={Mohamed Kaaniche (LAAS), Y. Deswarte (LAAS), Eric Alata (LAAS), Marc
Dacier (SC), Vincent Nicomette (LAAS)},
journal={IEEE/IFIP International Conference on Dependable Syste... | kaaniche2007empirical |
arxiv-35 | 0704.0865 | An architecture-based dependability modeling framework using AADL | <|reference_start|>An architecture-based dependability modeling framework using AADL: For efficiency reasons, the software system designers' will is to use an integrated set of methods and tools to describe specifications and designs, and also to perform analyses such as dependability, schedulability and performance. A... | arxiv | @article{rugina2007an,
title={An architecture-based dependability modeling framework using AADL},
author={Ana-Elena Rugina (LAAS), Karama Kanoun (LAAS), Mohamed Kaaniche (LAAS)},
journal={Proc. 10th IASTED International Conference on Software Engineering
and Applications (SEA'2006), Dallas (USA), 13-15 No... | rugina2007an |
arxiv-36 | 0704.0879 | A Hierarchical Approach for Dependability Analysis of a Commercial Cache-Based RAID Storage Architecture | <|reference_start|>A Hierarchical Approach for Dependability Analysis of a Commercial Cache-Based RAID Storage Architecture: We present a hierarchical simulation approach for the dependability analysis and evaluation of a highly available commercial cache-based RAID storage system. The archi-tecture is complex and incl... | arxiv | @article{kaaniche2007a,
title={A Hierarchical Approach for Dependability Analysis of a Commercial
Cache-Based RAID Storage Architecture},
author={Mohamed Kaaniche (LAAS), Luigi Romano (UIUC), Zbigniew Kalbarczyk
(UIUC), Ravishankar Iyer (UIUC), Rick Karcich (STORAGETEK)},
journal={Proc. 28th IEEE Intern... | kaaniche2007a |
arxiv-37 | 0704.0954 | Sensor Networks with Random Links: Topology Design for Distributed Consensus | <|reference_start|>Sensor Networks with Random Links: Topology Design for Distributed Consensus: In a sensor network, in practice, the communication among sensors is subject to:(1) errors or failures at random times; (3) costs; and(2) constraints since sensors and networks operate under scarce resources, such as power,... | arxiv | @article{kar2007sensor,
title={Sensor Networks with Random Links: Topology Design for Distributed
Consensus},
author={Soummya Kar and Jose M. F. Moura},
journal={arXiv preprint arXiv:0704.0954},
year={2007},
doi={10.1109/TSP.2008.920143},
archivePrefix={arXiv},
eprint={0704.0954},
prim... | kar2007sensor |
arxiv-38 | 0704.0967 | Cross-Layer Optimization of MIMO-Based Mesh Networks with Gaussian Vector Broadcast Channels | <|reference_start|>Cross-Layer Optimization of MIMO-Based Mesh Networks with Gaussian Vector Broadcast Channels: MIMO technology is one of the most significant advances in the past decade to increase channel capacity and has a great potential to improve network capacity for mesh networks. In a MIMO-based mesh network, ... | arxiv | @article{liu2007cross-layer,
title={Cross-Layer Optimization of MIMO-Based Mesh Networks with Gaussian
Vector Broadcast Channels},
author={Jia Liu and Y. Thomas Hou},
journal={arXiv preprint arXiv:0704.0967},
year={2007},
archivePrefix={arXiv},
eprint={0704.0967},
primaryClass={cs.IT cs.AR... | liu2007cross-layer |
arxiv-39 | 0704.0985 | Architecture for Pseudo Acausal Evolvable Embedded Systems | <|reference_start|>Architecture for Pseudo Acausal Evolvable Embedded Systems: Advances in semiconductor technology are contributing to the increasing complexity in the design of embedded systems. Architectures with novel techniques such as evolvable nature and autonomous behavior have engrossed lot of attention. This ... | arxiv | @article{abubakr2007architecture,
title={Architecture for Pseudo Acausal Evolvable Embedded Systems},
author={Mohd Abubakr, R.M.Vinay},
journal={arXiv preprint arXiv:0704.0985},
year={2007},
archivePrefix={arXiv},
eprint={0704.0985},
primaryClass={cs.NE cs.AI}
} | abubakr2007architecture |
arxiv-40 | 0704.1020 | The on-line shortest path problem under partial monitoring | <|reference_start|>The on-line shortest path problem under partial monitoring: The on-line shortest path problem is considered under various models of partial monitoring. Given a weighted directed acyclic graph whose edge weights can change in an arbitrary (adversarial) way, a decision maker has to choose in each round... | arxiv | @article{gyorgy2007the,
title={The on-line shortest path problem under partial monitoring},
author={Andras Gyorgy, Tamas Linder, Gabor Lugosi, Gyorgy Ottucsak},
journal={arXiv preprint arXiv:0704.1020},
year={2007},
archivePrefix={arXiv},
eprint={0704.1020},
primaryClass={cs.LG cs.SC}
} | gyorgy2007the |
arxiv-41 | 0704.1028 | A neural network approach to ordinal regression | <|reference_start|>A neural network approach to ordinal regression: Ordinal regression is an important type of learning, which has properties of both classification and regression. Here we describe a simple and effective approach to adapt a traditional neural network to learn ordinal categories. Our approach is a gener... | arxiv | @article{cheng2007a,
title={A neural network approach to ordinal regression},
author={Jianlin Cheng},
journal={arXiv preprint arXiv:0704.1028},
year={2007},
archivePrefix={arXiv},
eprint={0704.1028},
primaryClass={cs.LG cs.AI cs.NE}
} | cheng2007a |
arxiv-42 | 0704.1043 | On the Kolmogorov-Chaitin Complexity for short sequences | <|reference_start|>On the Kolmogorov-Chaitin Complexity for short sequences: A drawback of Kolmogorov-Chaitin complexity (K) as a function from s to the shortest program producing s is its noncomputability which limits its range of applicability. Moreover, when strings are short, the dependence of K on a particular uni... | arxiv | @article{delahaye2007on,
title={On the Kolmogorov-Chaitin Complexity for short sequences},
author={Jean-Paul Delahaye and Hector Zenil},
journal={arXiv preprint arXiv:0704.1043},
year={2007},
archivePrefix={arXiv},
eprint={0704.1043},
primaryClass={cs.CC cs.IT math.IT}
} | delahaye2007on |
arxiv-43 | 0704.1068 | Fast paths in large-scale dynamic road networks | <|reference_start|>Fast paths in large-scale dynamic road networks: Efficiently computing fast paths in large scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by several traffic information service providers who wish to offer a realistic fa... | arxiv | @article{nannicini2007fast,
title={Fast paths in large-scale dynamic road networks},
author={Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo
Liberti},
journal={arXiv preprint arXiv:0704.1068},
year={2007},
archivePrefix={arXiv},
eprint={0704.1068},
primaryClass={cs.N... | nannicini2007fast |
arxiv-44 | 0704.1070 | Differential Diversity Reception of MDPSK over Independent Rayleigh Channels with Nonidentical Branch Statistics and Asymmetric Fading Spectrum | <|reference_start|>Differential Diversity Reception of MDPSK over Independent Rayleigh Channels with Nonidentical Branch Statistics and Asymmetric Fading Spectrum: This paper is concerned with optimum diversity receiver structure and its performance analysis of differential phase shift keying (DPSK) with differential d... | arxiv | @article{fu2007differential,
title={Differential Diversity Reception of MDPSK over Independent Rayleigh
Channels with Nonidentical Branch Statistics and Asymmetric Fading Spectrum},
author={Hua Fu and Pooi Yuen Kam},
journal={arXiv preprint arXiv:0704.1070},
year={2007},
archivePrefix={arXiv},
... | fu2007differential |
arxiv-45 | 0704.1158 | Novelty and Collective Attention | <|reference_start|>Novelty and Collective Attention: The subject of collective attention is central to an information age where millions of people are inundated with daily messages. It is thus of interest to understand how attention to novel items propagates and eventually fades among large populations. We have analyze... | arxiv | @article{wu2007novelty,
title={Novelty and Collective Attention},
author={Fang Wu and Bernardo A. Huberman},
journal={arXiv preprint arXiv:0704.1158},
year={2007},
doi={10.1073/pnas.0704916104},
archivePrefix={arXiv},
eprint={0704.1158},
primaryClass={cs.CY cs.IR physics.soc-ph}
} | wu2007novelty |
arxiv-46 | 0704.1196 | Novel algorithm to calculate hypervolume indicator of Pareto approximation set | <|reference_start|>Novel algorithm to calculate hypervolume indicator of Pareto approximation set: Hypervolume indicator is a commonly accepted quality measure for comparing Pareto approximation set generated by multi-objective optimizers. The best known algorithm to calculate it for $n$ points in $d$-dimensional space... | arxiv | @article{yang2007novel,
title={Novel algorithm to calculate hypervolume indicator of Pareto
approximation set},
author={Qing Yang and Shengchao Ding},
journal={arXiv preprint arXiv:0704.1196},
year={2007},
archivePrefix={arXiv},
eprint={0704.1196},
primaryClass={cs.CG cs.NE}
} | yang2007novel |
arxiv-47 | 0704.1198 | A Doubly Distributed Genetic Algorithm for Network Coding | <|reference_start|>A Doubly Distributed Genetic Algorithm for Network Coding: We present a genetic algorithm which is distributed in two novel ways: along genotype and temporal axes. Our algorithm first distributes, for every member of the population, a subset of the genotype to each network node, rather than a subset ... | arxiv | @article{kim2007a,
title={A Doubly Distributed Genetic Algorithm for Network Coding},
author={Minkyu Kim, Varun Aggarwal, Una-May O'Reilly, Muriel Medard},
journal={arXiv preprint arXiv:0704.1198},
year={2007},
archivePrefix={arXiv},
eprint={0704.1198},
primaryClass={cs.NE cs.NI}
} | kim2007a |
arxiv-48 | 0704.1267 | Text Line Segmentation of Historical Documents: a Survey | <|reference_start|>Text Line Segmentation of Historical Documents: a Survey: There is a huge amount of historical documents in libraries and in various National Archives that have not been exploited electronically. Although automatic reading of complete pages remains, in most cases, a long-term objective, tasks such as... | arxiv | @article{likforman-sulem2007text,
title={Text Line Segmentation of Historical Documents: a Survey},
author={Laurence Likforman-Sulem, Abderrazak Zahour, Bruno Taconet},
journal={Vol. 9, no 2-4, April 2007, pp. 123-138},
year={2007},
doi={10.1007/s10032-006-0023-z},
archivePrefix={arXiv},
epr... | likforman-sulem2007text |
arxiv-49 | 0704.1269 | Phase Transitions in the Coloring of Random Graphs | <|reference_start|>Phase Transitions in the Coloring of Random Graphs: We consider the problem of coloring the vertices of a large sparse random graph with a given number of colors so that no adjacent vertices have the same color. Using the cavity method, we present a detailed and systematic analytical study of the spa... | arxiv | @article{zdeborová2007phase,
title={Phase Transitions in the Coloring of Random Graphs},
author={Lenka Zdeborov'a, Florent Krzakala},
journal={Phys. Rev. E 76, 031131 (2007)},
year={2007},
doi={10.1103/PhysRevE.76.031131},
archivePrefix={arXiv},
eprint={0704.1269},
primaryClass={cond-mat... | zdeborová2007phase |
arxiv-50 | 0704.1274 | Parametric Learning and Monte Carlo Optimization | <|reference_start|>Parametric Learning and Monte Carlo Optimization: This paper uncovers and explores the close relationship between Monte Carlo Optimization of a parametrized integral (MCO), Parametric machine-Learning (PL), and `blackbox' or `oracle'-based optimization (BO). We make four contributions. First, we prov... | arxiv | @article{wolpert2007parametric,
title={Parametric Learning and Monte Carlo Optimization},
author={David H. Wolpert and Dev G. Rajnarayan},
journal={arXiv preprint arXiv:0704.1274},
year={2007},
archivePrefix={arXiv},
eprint={0704.1274},
primaryClass={cs.LG}
} | wolpert2007parametric |
arxiv-51 | 0704.1294 | A Disciplined Approach to Adopting Agile Practices: The Agile Adoption Framework | <|reference_start|>A Disciplined Approach to Adopting Agile Practices: The Agile Adoption Framework: Many organizations aspire to adopt agile processes to take advantage of the numerous benefits that it offers to an organization. Those benefits include, but are not limited to, quicker return on investment, better softw... | arxiv | @article{sidky2007a,
title={A Disciplined Approach to Adopting Agile Practices: The Agile Adoption
Framework},
author={Ahmed Sidky, James Arthur, Shawn Bohner},
journal={arXiv preprint arXiv:0704.1294},
year={2007},
archivePrefix={arXiv},
eprint={0704.1294},
primaryClass={cs.SE}
} | sidky2007a |
arxiv-52 | 0704.1308 | Antenna Combining for the MIMO Downlink Channel | <|reference_start|>Antenna Combining for the MIMO Downlink Channel: A multiple antenna downlink channel where limited channel feedback is available to the transmitter is considered. In a vector downlink channel (single antenna at each receiver), the transmit antenna array can be used to transmit separate data streams t... | arxiv | @article{jindal2007antenna,
title={Antenna Combining for the MIMO Downlink Channel},
author={Nihar Jindal},
journal={arXiv preprint arXiv:0704.1308},
year={2007},
doi={10.1109/T-WC.2008.070383},
archivePrefix={arXiv},
eprint={0704.1308},
primaryClass={cs.IT math.IT}
} | jindal2007antenna |
arxiv-53 | 0704.1317 | Low Density Lattice Codes | <|reference_start|>Low Density Lattice Codes: Low density lattice codes (LDLC) are novel lattice codes that can be decoded efficiently and approach the capacity of the additive white Gaussian noise (AWGN) channel. In LDLC a codeword x is generated directly at the n-dimensional Euclidean space as a linear transformation... | arxiv | @article{sommer2007low,
title={Low Density Lattice Codes},
author={Naftali Sommer, Meir Feder and Ofir Shalvi},
journal={arXiv preprint arXiv:0704.1317},
year={2007},
archivePrefix={arXiv},
eprint={0704.1317},
primaryClass={cs.IT math.IT}
} | sommer2007low |
arxiv-54 | 0704.1353 | Supporting Knowledge and Expertise Finding within Australia's Defence Science and Technology Organisation | <|reference_start|>Supporting Knowledge and Expertise Finding within Australia's Defence Science and Technology Organisation: This paper reports on work aimed at supporting knowledge and expertise finding within a large Research and Development (R&D) organisation. The paper first discusses the nature of knowledge impor... | arxiv | @article{prekop2007supporting,
title={Supporting Knowledge and Expertise Finding within Australia's Defence
Science and Technology Organisation},
author={Paul Prekop},
journal={arXiv preprint arXiv:0704.1353},
year={2007},
archivePrefix={arXiv},
eprint={0704.1353},
primaryClass={cs.OH cs.D... | prekop2007supporting |
arxiv-55 | 0704.1358 | Distance preserving mappings from ternary vectors to permutations | <|reference_start|>Distance preserving mappings from ternary vectors to permutations: Distance-preserving mappings (DPMs) are mappings from the set of all q-ary vectors of a fixed length to the set of permutations of the same or longer length such that every two distinct vectors are mapped to permutations with the same... | arxiv | @article{lin2007distance,
title={Distance preserving mappings from ternary vectors to permutations},
author={Jyh-Shyan Lin, Jen-Chun Chang, Rong-Jaye Chen, Torleiv Kl{o}ve},
journal={arXiv preprint arXiv:0704.1358},
year={2007},
archivePrefix={arXiv},
eprint={0704.1358},
primaryClass={cs.DM ... | lin2007distance |
arxiv-56 | 0704.1373 | A Language-Based Approach for Improving the Robustness of Network Application Protocol Implementations | <|reference_start|>A Language-Based Approach for Improving the Robustness of Network Application Protocol Implementations: The secure and robust functioning of a network relies on the defect-free implementation of network applications. As network protocols have become increasingly complex, however, hand-writing network... | arxiv | @article{laurent2007a,
title={A Language-Based Approach for Improving the Robustness of Network
Application Protocol Implementations},
author={Burgy Laurent (INRIA Futurs), Laurent R'eveill`ere (INRIA Futurs),
Julia Lawall (DIKU), Gilles Muller (INRIA Rennes)},
journal={arXiv preprint arXiv:0704.1373},
... | laurent2007a |
arxiv-57 | 0704.1394 | Calculating Valid Domains for BDD-Based Interactive Configuration | <|reference_start|>Calculating Valid Domains for BDD-Based Interactive Configuration: In these notes we formally describe the functionality of Calculating Valid Domains from the BDD representing the solution space of valid configurations. The formalization is largely based on the CLab configuration framework.<|referenc... | arxiv | @article{hadzic2007calculating,
title={Calculating Valid Domains for BDD-Based Interactive Configuration},
author={Tarik Hadzic, Rune Moller Jensen, Henrik Reif Andersen},
journal={arXiv preprint arXiv:0704.1394},
year={2007},
archivePrefix={arXiv},
eprint={0704.1394},
primaryClass={cs.AI}
} | hadzic2007calculating |
arxiv-58 | 0704.1409 | Preconditioned Temporal Difference Learning | <|reference_start|>Preconditioned Temporal Difference Learning: This paper has been withdrawn by the author. This draft is withdrawn for its poor quality in english, unfortunately produced by the author when he was just starting his science route. Look at the ICML version instead: http://icml2008.cs.helsinki.fi/papers/... | arxiv | @article{hengshuai2007preconditioned,
title={Preconditioned Temporal Difference Learning},
author={Yao HengShuai},
journal={arXiv preprint arXiv:0704.1409},
year={2007},
archivePrefix={arXiv},
eprint={0704.1409},
primaryClass={cs.LG cs.AI}
} | hengshuai2007preconditioned |
arxiv-59 | 0704.1411 | Trellis-Coded Quantization Based on Maximum-Hamming-Distance Binary Codes | <|reference_start|>Trellis-Coded Quantization Based on Maximum-Hamming-Distance Binary Codes: Most design approaches for trellis-coded quantization take advantage of the duality of trellis-coded quantization with trellis-coded modulation, and use the same empirically-found convolutional codes to label the trellis branc... | arxiv | @article{cappellari2007trellis-coded,
title={Trellis-Coded Quantization Based on Maximum-Hamming-Distance Binary
Codes},
author={Lorenzo Cappellari},
journal={arXiv preprint arXiv:0704.1411},
year={2007},
archivePrefix={arXiv},
eprint={0704.1411},
primaryClass={cs.IT math.IT}
} | cappellari2007trellis-coded |
arxiv-60 | 0704.1455 | A Better Good-Turing Estimator for Sequence Probabilities | <|reference_start|>A Better Good-Turing Estimator for Sequence Probabilities: We consider the problem of estimating the probability of an observed string drawn i.i.d. from an unknown distribution. The key feature of our study is that the length of the observed string is assumed to be of the same order as the size of th... | arxiv | @article{wagner2007a,
title={A Better Good-Turing Estimator for Sequence Probabilities},
author={Aaron B. Wagner, Pramod Viswanath, and Sanjeev R. Kulkarni},
journal={arXiv preprint arXiv:0704.1455},
year={2007},
archivePrefix={arXiv},
eprint={0704.1455},
primaryClass={cs.IT math.IT}
} | wagner2007a |
arxiv-61 | 0704.1524 | GLRT-Optimal Noncoherent Lattice Decoding | <|reference_start|>GLRT-Optimal Noncoherent Lattice Decoding: This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of QAM and PAM signals over complex-valued fading channels. The algorithms are optimal in terms of the generalized likelihood ratio test (GLRT). The computatio... | arxiv | @article{ryan2007glrt-optimal,
title={GLRT-Optimal Noncoherent Lattice Decoding},
author={Daniel J. Ryan, Iain B. Collings and I. Vaughan L. Clarkson},
journal={arXiv preprint arXiv:0704.1524},
year={2007},
doi={10.1109/TSP.2007.894237},
archivePrefix={arXiv},
eprint={0704.1524},
primary... | ryan2007glrt-optimal |
arxiv-62 | 0704.1571 | On restrictions of balanced 2-interval graphs | <|reference_start|>On restrictions of balanced 2-interval graphs: The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply restrictions on the 2-interval graphs, and justify the introducti... | arxiv | @article{gambette2007on,
title={On restrictions of balanced 2-interval graphs},
author={Philippe Gambette (LIAFA), St'ephane Vialette (LRI)},
journal={Dans Lecture Notes In Computer Science - 33rd International
Workshop on Graph-Theoretic Concepts in Computer Science (WG'07), Dornburg :
Allemagne (2007)... | gambette2007on |
arxiv-63 | 0704.1675 | Exploiting Social Annotation for Automatic Resource Discovery | <|reference_start|>Exploiting Social Annotation for Automatic Resource Discovery: Information integration applications, such as mediators or mashups, that require access to information resources currently rely on users manually discovering and integrating them in the application. Manual resource discovery is a slow pro... | arxiv | @article{plangprasopchok2007exploiting,
title={Exploiting Social Annotation for Automatic Resource Discovery},
author={Anon Plangprasopchok and Kristina Lerman},
journal={arXiv preprint arXiv:0704.1675},
year={2007},
archivePrefix={arXiv},
eprint={0704.1675},
primaryClass={cs.AI cs.CY cs.DL}... | plangprasopchok2007exploiting |
arxiv-64 | 0704.1676 | Personalizing Image Search Results on Flickr | <|reference_start|>Personalizing Image Search Results on Flickr: The social media site Flickr allows users to upload their photos, annotate them with tags, submit them to groups, and also to form social networks by adding other users as contacts. Flickr offers multiple ways of browsing or searching it. One option is ta... | arxiv | @article{lerman2007personalizing,
title={Personalizing Image Search Results on Flickr},
author={Kristina Lerman, Anon Plangprasopchok and Chio Wong},
journal={arXiv preprint arXiv:0704.1676},
year={2007},
archivePrefix={arXiv},
eprint={0704.1676},
primaryClass={cs.IR cs.AI cs.CY cs.DL cs.HC}... | lerman2007personalizing |
arxiv-65 | 0704.1678 | Settling the Complexity of Computing Two-Player Nash Equilibria | <|reference_start|>Settling the Complexity of Computing Two-Player Nash Equilibria: We settle a long-standing open question in algorithmic game theory. We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD Polynomial Parity Argument, Directed v... | arxiv | @article{chen2007settling,
title={Settling the Complexity of Computing Two-Player Nash Equilibria},
author={Xi Chen, Xiaotie Deng, Shang-Hua Teng},
journal={arXiv preprint arXiv:0704.1678},
year={2007},
archivePrefix={arXiv},
eprint={0704.1678},
primaryClass={cs.GT cs.CC}
} | chen2007settling |
arxiv-66 | 0704.1694 | Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers | <|reference_start|>Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers: A k-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit x_i of the message by querying only k bits of the codeword... | arxiv | @article{kedlaya2007locally,
title={Locally Decodable Codes From Nice Subsets of Finite Fields and Prime
Factors of Mersenne Numbers},
author={Kiran S. Kedlaya, Sergey Yekhanin},
journal={arXiv preprint arXiv:0704.1694},
year={2007},
archivePrefix={arXiv},
eprint={0704.1694},
primaryClass=... | kedlaya2007locally |
arxiv-67 | 0704.1707 | A Cut-free Sequent Calculus for Bi-Intuitionistic Logic: Extended Version | <|reference_start|>A Cut-free Sequent Calculus for Bi-Intuitionistic Logic: Extended Version: Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subse... | arxiv | @article{buisman2007a,
title={A Cut-free Sequent Calculus for Bi-Intuitionistic Logic: Extended
Version},
author={Linda Buisman and Rajeev Gor'e},
journal={arXiv preprint arXiv:0704.1707},
year={2007},
archivePrefix={arXiv},
eprint={0704.1707},
primaryClass={cs.LO}
} | buisman2007a |
arxiv-68 | 0704.1709 | Traitement Des Donnees Manquantes Au Moyen De L'Algorithme De Kohonen | <|reference_start|>Traitement Des Donnees Manquantes Au Moyen De L'Algorithme De Kohonen: Nous montrons comment il est possible d'utiliser l'algorithme d'auto organisation de Kohonen pour traiter des donn\'ees avec valeurs manquantes et estimer ces derni\`eres. Apr\`es un rappel m\'ethodologique, nous illustrons notre ... | arxiv | @article{cottrell2007traitement,
title={Traitement Des Donnees Manquantes Au Moyen De L'Algorithme De Kohonen},
author={Marie Cottrell (SAMOS, Matisse), Smail Ibbou (SAMOS, Matisse), Patrick
Letr'emy (SAMOS, Matisse)},
journal={Actes de la dixi\`eme conf\'erence ACSEG 2003 (Nantes) (2003)
201-217},
... | cottrell2007traitement |
arxiv-69 | 0704.1748 | Self-Organization applied to Dynamic Network Layout | <|reference_start|>Self-Organization applied to Dynamic Network Layout: As networks and their structure have become a major field of research, a strong demand for network visualization has emerged. We address this challenge by formalizing the well established spring layout in terms of dynamic equations. We thus open up... | arxiv | @article{geipel2007self-organization,
title={Self-Organization applied to Dynamic Network Layout},
author={Markus M. Geipel},
journal={International Journal of Modern Physics C vol. 18, no. 10 (2007),
pp. 1537-1549},
year={2007},
doi={10.1142/S0129183107011558},
archivePrefix={arXiv},
epri... | geipel2007self-organization |
arxiv-70 | 0704.1751 | Information Theoretic Proofs of Entropy Power Inequalities | <|reference_start|>Information Theoretic Proofs of Entropy Power Inequalities: While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, up to now Shannon's entropy power inequality (EPI) is an exception: Existing information theoretic proofs of the ... | arxiv | @article{rioul2007information,
title={Information Theoretic Proofs of Entropy Power Inequalities},
author={Olivier Rioul},
journal={arXiv preprint arXiv:0704.1751},
year={2007},
doi={10.1109/TIT.2010.2090193},
archivePrefix={arXiv},
eprint={0704.1751},
primaryClass={cs.IT math.IT}
} | rioul2007information |
arxiv-71 | 0704.1756 | The Invar Tensor Package | <|reference_start|>The Invar Tensor Package: The Invar package is introduced, a fast manipulator of generic scalar polynomial expressions formed from the Riemann tensor of a four-dimensional metric-compatible connection. The package can maximally simplify any polynomial containing tensor products of up to seven Riemann... | arxiv | @article{martin-garcia2007the,
title={The Invar Tensor Package},
author={Jose M. Martin-Garcia, Renato Portugal, Leon R. U. Manssur},
journal={Comp. Phys. Commun. 177 (2007) 640-648},
year={2007},
doi={10.1016/j.cpc.2007.05.015},
archivePrefix={arXiv},
eprint={0704.1756},
primaryClass={c... | martin-garcia2007the |
arxiv-72 | 0704.1768 | Assessment and Propagation of Input Uncertainty in Tree-based Option Pricing Models | <|reference_start|>Assessment and Propagation of Input Uncertainty in Tree-based Option Pricing Models: This paper aims to provide a practical example on the assessment and propagation of input uncertainty for option pricing when using tree-based methods. Input uncertainty is propagated into output uncertainty, reflect... | arxiv | @article{gzyl2007assessment,
title={Assessment and Propagation of Input Uncertainty in Tree-based Option
Pricing Models},
author={Henryk Gzyl, German Molina, Enrique ter Horst},
journal={arXiv preprint arXiv:0704.1768},
year={2007},
archivePrefix={arXiv},
eprint={0704.1768},
primaryClass={... | gzyl2007assessment |
arxiv-73 | 0704.1783 | Unicast and Multicast Qos Routing with Soft Constraint Logic Programming | <|reference_start|>Unicast and Multicast Qos Routing with Soft Constraint Logic Programming: We present a formal model to represent and solve the unicast/multicast routing problem in networks with Quality of Service (QoS) requirements. To attain this, first we translate the network adapting it to a weighted graph (unic... | arxiv | @article{bistarelli2007unicast,
title={Unicast and Multicast Qos Routing with Soft Constraint Logic Programming},
author={Stefano Bistarelli, Ugo Montanari, Francesca Rossi, Francesco Santini},
journal={arXiv preprint arXiv:0704.1783},
year={2007},
archivePrefix={arXiv},
eprint={0704.1783},
... | bistarelli2007unicast |
arxiv-74 | 0704.1818 | Low-density graph codes that are optimal for source/channel coding and binning | <|reference_start|>Low-density graph codes that are optimal for source/channel coding and binning: We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-density parity check (LDPC) code. Our firs... | arxiv | @article{wainwright2007low-density,
title={Low-density graph codes that are optimal for source/channel coding and
binning},
author={Martin J. Wainwright, Emin Martinian},
journal={arXiv preprint arXiv:0704.1818},
year={2007},
number={Technical report 730},
archivePrefix={arXiv},
eprint={07... | wainwright2007low-density |
arxiv-75 | 0704.1827 | Transaction-Oriented Simulation In Ad Hoc Grids | <|reference_start|>Transaction-Oriented Simulation In Ad Hoc Grids: This paper analyses the possibilities of performing parallel transaction-oriented simulations with a special focus on the space-parallel approach and discrete event simulation synchronisation algorithms that are suitable for transaction-oriented simula... | arxiv | @article{krafft2007transaction-oriented,
title={Transaction-Oriented Simulation In Ad Hoc Grids},
author={Gerald Krafft},
journal={arXiv preprint arXiv:0704.1827},
year={2007},
archivePrefix={arXiv},
eprint={0704.1827},
primaryClass={cs.DC}
} | krafft2007transaction-oriented |
arxiv-76 | 0704.1829 | On-line Chain Partitions of Up-growing Semi-orders | <|reference_start|>On-line Chain Partitions of Up-growing Semi-orders: On-line chain partition is a two-player game between Spoiler and Algorithm. Spoiler presents a partially ordered set, point by point. Algorithm assigns incoming points (immediately and irrevocably) to the chains which constitute a chain partition of... | arxiv | @article{felsner2007on-line,
title={On-line Chain Partitions of Up-growing Semi-orders},
author={Stefan Felsner, Kamil Kloch, Grzegorz Matecki, and Piotr Micek},
journal={arXiv preprint arXiv:0704.1829},
year={2007},
archivePrefix={arXiv},
eprint={0704.1829},
primaryClass={cs.DM}
} | felsner2007on-line |
arxiv-77 | 0704.1833 | Analysis of the 80211e Enhanced Distributed Channel Access Function | <|reference_start|>Analysis of the 80211e Enhanced Distributed Channel Access Function: The IEEE 802.11e standard revises the Medium Access Control (MAC) layer of the former IEEE 802.11 standard for Quality-of-Service (QoS) provision in the Wireless Local Area Networks (WLANs). The Enhanced Distributed Channel Access (... | arxiv | @article{inan2007analysis,
title={Analysis of the 802.11e Enhanced Distributed Channel Access Function},
author={Inanc Inan, Feyza Keceli, Ender Ayanoglu},
journal={arXiv preprint arXiv:0704.1833},
year={2007},
archivePrefix={arXiv},
eprint={0704.1833},
primaryClass={cs.NI}
} | inan2007analysis |
arxiv-78 | 0704.1838 | Performance Analysis of the IEEE 80211e Enhanced Distributed Coordination Function using Cycle Time Approach | <|reference_start|>Performance Analysis of the IEEE 80211e Enhanced Distributed Coordination Function using Cycle Time Approach: The recently ratified IEEE 802.11e standard defines the Enhanced Distributed Channel Access (EDCA) function for Quality-of-Service (QoS) provisioning in the Wireless Local Area Networks (WLAN... | arxiv | @article{inan2007performance,
title={Performance Analysis of the IEEE 802.11e Enhanced Distributed
Coordination Function using Cycle Time Approach},
author={Inanc Inan, Feyza Keceli, Ender Ayanoglu},
journal={arXiv preprint arXiv:0704.1838},
year={2007},
archivePrefix={arXiv},
eprint={0704.183... | inan2007performance |
arxiv-79 | 0704.1842 | Fairness Provision in the IEEE 80211e Infrastructure Basic Service Set | <|reference_start|>Fairness Provision in the IEEE 80211e Infrastructure Basic Service Set: Most of the deployed IEEE 802.11e Wireless Local Area Networks (WLANs) use infrastructure Basic Service Set (BSS) in which an Access Point (AP) serves as a gateway between wired and wireless domains. We present the unfairness pro... | arxiv | @article{keceli2007fairness,
title={Fairness Provision in the IEEE 802.11e Infrastructure Basic Service Set},
author={Feyza Keceli, Inanc Inan, Ender Ayanoglu},
journal={arXiv preprint arXiv:0704.1842},
year={2007},
archivePrefix={arXiv},
eprint={0704.1842},
primaryClass={cs.OH}
} | keceli2007fairness |
arxiv-80 | 0704.1873 | An Achievable Rate Region for Interference Channels with Conferencing | <|reference_start|>An Achievable Rate Region for Interference Channels with Conferencing: In this paper, we propose an achievable rate region for discrete memoryless interference channels with conferencing at the transmitter side. We employ superposition block Markov encoding, combined with simultaneous superposition c... | arxiv | @article{cao2007an,
title={An Achievable Rate Region for Interference Channels with Conferencing},
author={Yi Cao and Biao Chen},
journal={arXiv preprint arXiv:0704.1873},
year={2007},
archivePrefix={arXiv},
eprint={0704.1873},
primaryClass={cs.IT math.IT}
} | cao2007an |
arxiv-81 | 0704.1886 | An algebraic generalization of Kripke structures | <|reference_start|>An algebraic generalization of Kripke structures: The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional algebraic semanti... | arxiv | @article{marcelino2007an,
title={An algebraic generalization of Kripke structures},
author={S'ergio Marcelino and Pedro Resende},
journal={Math. Proc. Cambridge Philos. Soc. 145 (2008) 549-577},
year={2007},
doi={10.1017/S0305004108001667},
archivePrefix={arXiv},
eprint={0704.1886},
prim... | marcelino2007an |
arxiv-82 | 0704.1925 | Blind Identification of Distributed Antenna Systems with Multiple Carrier Frequency Offsets | <|reference_start|>Blind Identification of Distributed Antenna Systems with Multiple Carrier Frequency Offsets: In spatially distributed multiuser antenna systems, the received signal contains multiple carrier-frequency offsets (CFOs) arising from mismatch between the oscillators of transmitters and receivers. This res... | arxiv | @article{yu2007blind,
title={Blind Identification of Distributed Antenna Systems with Multiple
Carrier Frequency Offsets},
author={Yuanning Yu, Athina P. Petropulu and H. Vincent Poor},
journal={arXiv preprint arXiv:0704.1925},
year={2007},
archivePrefix={arXiv},
eprint={0704.1925},
primar... | yu2007blind |
arxiv-83 | 0704.2010 | A study of structural properties on profiles HMMs | <|reference_start|>A study of structural properties on profiles HMMs: Motivation: Profile hidden Markov Models (pHMMs) are a popular and very useful tool in the detection of the remote homologue protein families. Unfortunately, their performance is not always satisfactory when proteins are in the 'twilight zone'. We pr... | arxiv | @article{bernardes2007a,
title={A study of structural properties on profiles HMMs},
author={Juliana S Bernardes, Alberto Davila, Vitor Santos Costa, Gerson
Zaverucha},
journal={arXiv preprint arXiv:0704.2010},
year={2007},
archivePrefix={arXiv},
eprint={0704.2010},
primaryClass={cs.AI}
} | bernardes2007a |
arxiv-84 | 0704.2014 | Extensive Games with Possibly Unaware Players | <|reference_start|>Extensive Games with Possibly Unaware Players: Standard game theory assumes that the structure of the game is common knowledge among players. We relax this assumption by considering extensive games where agents may be unaware of the complete structure of the game. In particular, they may not be aware... | arxiv | @article{halpern2007extensive,
title={Extensive Games with Possibly Unaware Players},
author={Joseph Y. Halpern, Leandro C. R^ego},
journal={arXiv preprint arXiv:0704.2014},
year={2007},
archivePrefix={arXiv},
eprint={0704.2014},
primaryClass={cs.GT cs.MA}
} | halpern2007extensive |
arxiv-85 | 0704.2017 | Large System Analysis of Game-Theoretic Power Control in UWB Wireless Networks with Rake Receivers | <|reference_start|>Large System Analysis of Game-Theoretic Power Control in UWB Wireless Networks with Rake Receivers: This paper studies the performance of partial-Rake (PRake) receivers in impulse-radio ultrawideband wireless networks when an energy-efficient power control scheme is adopted. Due to the large bandwidt... | arxiv | @article{bacci2007large,
title={Large System Analysis of Game-Theoretic Power Control in UWB Wireless
Networks with Rake Receivers},
author={G. Bacci, M. Luise, H.V. Poor},
journal={arXiv preprint arXiv:0704.2017},
year={2007},
doi={10.1109/SPAWC.2007.4401311},
archivePrefix={arXiv},
eprin... | bacci2007large |
arxiv-86 | 0704.2083 | Introduction to Arabic Speech Recognition Using CMUSphinx System | <|reference_start|>Introduction to Arabic Speech Recognition Using CMUSphinx System: In this paper Arabic was investigated from the speech recognition problem point of view. We propose a novel approach to build an Arabic Automated Speech Recognition System (ASR). This system is based on the open source CMU Sphinx-4, fr... | arxiv | @article{satori2007introduction,
title={Introduction to Arabic Speech Recognition Using CMUSphinx System},
author={H. Satori, M. Harti and N. Chenfour},
journal={arXiv preprint arXiv:0704.2083},
year={2007},
archivePrefix={arXiv},
eprint={0704.2083},
primaryClass={cs.CL cs.AI}
} | satori2007introduction |
arxiv-87 | 0704.2092 | A Note on the Inapproximability of Correlation Clustering | <|reference_start|>A Note on the Inapproximability of Correlation Clustering: We consider inapproximability of the correlation clustering problem defined as follows: Given a graph $G = (V,E)$ where each edge is labeled either "+" (similar) or "-" (dissimilar), correlation clustering seeks to partition the vertices into... | arxiv | @article{tan2007a,
title={A Note on the Inapproximability of Correlation Clustering},
author={Jinsong Tan},
journal={Information Processing Letters, 108: 331-335, 2008},
year={2007},
archivePrefix={arXiv},
eprint={0704.2092},
primaryClass={cs.LG cs.DS}
} | tan2007a |
arxiv-88 | 0704.2201 | Arabic Speech Recognition System using CMU-Sphinx4 | <|reference_start|>Arabic Speech Recognition System using CMU-Sphinx4: In this paper we present the creation of an Arabic version of Automated Speech Recognition System (ASR). This system is based on the open source Sphinx-4, from the Carnegie Mellon University. Which is a speech recognition system based on discrete hi... | arxiv | @article{satori2007arabic,
title={Arabic Speech Recognition System using CMU-Sphinx4},
author={H. Satori, M. Harti and N. Chenfour},
journal={arXiv preprint arXiv:0704.2201},
year={2007},
archivePrefix={arXiv},
eprint={0704.2201},
primaryClass={cs.CL cs.AI}
} | satori2007arabic |
arxiv-89 | 0704.2258 | On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes | <|reference_start|>On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes: We prove that approximating the size of stopping and trapping sets in Tanner graphs of linear block codes, and more restrictively, the class of low-density parity-check (LDPC) codes, is NP-hard. The ramifications of our findin... | arxiv | @article{mcgregor2007on,
title={On the Hardness of Approximating Stopping and Trapping Sets in LDPC
Codes},
author={Andrew McGregor and Olgica Milenkovic},
journal={arXiv preprint arXiv:0704.2258},
year={2007},
archivePrefix={arXiv},
eprint={0704.2258},
primaryClass={cs.IT math.IT}
} | mcgregor2007on |
arxiv-90 | 0704.2259 | The Wiretap Channel with Feedback: Encryption over the Channel | <|reference_start|>The Wiretap Channel with Feedback: Encryption over the Channel: In this work, the critical role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is established. Unlike previous works, where a noiseless public discussion channel is used for feedback, the feed-forward and feed... | arxiv | @article{lai2007the,
title={The Wiretap Channel with Feedback: Encryption over the Channel},
author={Lifeng Lai, Hesham El Gamal and H. Vincent Poor},
journal={arXiv preprint arXiv:0704.2259},
year={2007},
doi={10.1109/TIT.2008.929914},
archivePrefix={arXiv},
eprint={0704.2259},
primaryC... | lai2007the |
arxiv-91 | 0704.2282 | Kekul\'e Cells for Molecular Computation | <|reference_start|>Kekul\'e Cells for Molecular Computation: The configurations of single and double bonds in polycyclic hydrocarbons are abstracted as Kekul\'e states of graphs. Sending a so-called soliton over an open channel between ports (external nodes) of the graph changes the Kekul\'e state and therewith the set... | arxiv | @article{hesselink2007kekul\'e,
title={Kekul\'e Cells for Molecular Computation},
author={W.H. Hesselink and J.C. Hummelen and H.T. Jonkman and H.G. Reker and
G.R. Renardel de Lavalette and M.H. van der Veen},
journal={arXiv preprint arXiv:0704.2282},
year={2007},
archivePrefix={arXiv},
eprint... | hesselink2007kekul\'e |
arxiv-92 | 0704.2295 | Using Image Attributes for Human Identification Protocols | <|reference_start|>Using Image Attributes for Human Identification Protocols: A secure human identification protocol aims at authenticating human users to a remote server when even the users' inputs are not hidden from an adversary. Recently, the authors proposed a human identification protocol in the RSA Conference 20... | arxiv | @article{jameel2007using,
title={Using Image Attributes for Human Identification Protocols},
author={Hassan Jameel, Heejo Lee and Sungyoung Lee},
journal={arXiv preprint arXiv:0704.2295},
year={2007},
archivePrefix={arXiv},
eprint={0704.2295},
primaryClass={cs.CR}
} | jameel2007using |
arxiv-93 | 0704.2344 | Parallel computing for the finite element method | <|reference_start|>Parallel computing for the finite element method: A finite element method is presented to compute time harmonic microwave fields in three dimensional configurations. Nodal-based finite elements have been coupled with an absorbing boundary condition to solve open boundary problems. This paper describe... | arxiv | @article{vollaire2007parallel,
title={Parallel computing for the finite element method},
author={Christian Vollaire (CEGELY), Laurent Nicolas (CEGELY), Alain Nicolas
(CEGELY)},
journal={EUROPEAN PHYSICAL JOURNAL Applied Physics 1, 3 (03/1998) 305-314},
year={2007},
doi={10.1051/epjap:1998151},
... | vollaire2007parallel |
arxiv-94 | 0704.2351 | Parallel computation of the rank of large sparse matrices from algebraic K-theory | <|reference_start|>Parallel computation of the rank of large sparse matrices from algebraic K-theory: This paper deals with the computation of the rank and of some integer Smith forms of a series of sparse matrices arising in algebraic K-theory. The number of non zero entries in the considered matrices ranges from 8 to... | arxiv | @article{dumas2007parallel,
title={Parallel computation of the rank of large sparse matrices from algebraic
K-theory},
author={Jean-Guillaume Dumas (LMC - IMAG), Philippe Elbaz-Vincent (I3M),
Pascal Giorgi (LP2A), Anna Urbanska (LMC - IMAG)},
journal={arXiv preprint arXiv:0704.2351},
year={2007},
... | dumas2007parallel |
arxiv-95 | 0704.2353 | Scaling Laws of Cognitive Networks | <|reference_start|>Scaling Laws of Cognitive Networks: We consider a cognitive network consisting of n random pairs of cognitive transmitters and receivers communicating simultaneously in the presence of multiple primary users. Of interest is how the maximum throughput achieved by the cognitive users scales with n. Fur... | arxiv | @article{vu2007scaling,
title={Scaling Laws of Cognitive Networks},
author={Mai Vu, Natasha Devroye, Masoud Sharif and Vahid Tarokh},
journal={arXiv preprint arXiv:0704.2353},
year={2007},
doi={10.1109/CROWNCOM.2007.4549764},
archivePrefix={arXiv},
eprint={0704.2353},
primaryClass={cs.IT... | vu2007scaling |
arxiv-96 | 0704.2355 | A Nice Labelling for Tree-Like Event Structures of Degree 3 | <|reference_start|>A Nice Labelling for Tree-Like Event Structures of Degree 3: We address the problem of finding nice labellings for event structures of degree 3. We develop a minimum theory by which we prove that the labelling number of an event structure of degree 3 is bounded by a linear function of the heigh... | arxiv | @article{santocanale2007a,
title={A Nice Labelling for Tree-Like Event Structures of Degree 3},
author={Luigi Santocanale (LIF)},
journal={arXiv preprint arXiv:0704.2355},
year={2007},
archivePrefix={arXiv},
eprint={0704.2355},
primaryClass={cs.DC}
} | santocanale2007a |
arxiv-97 | 0704.2375 | Power control algorithms for CDMA networks based on large system analysis | <|reference_start|>Power control algorithms for CDMA networks based on large system analysis: Power control is a fundamental task accomplished in any wireless cellular network; its aim is to set the transmit power of any mobile terminal, so that each user is able to achieve its own target SINR. While conventional power... | arxiv | @article{buzzi2007power,
title={Power control algorithms for CDMA networks based on large system
analysis},
author={Stefano Buzzi and H. Vincent Poor},
journal={arXiv preprint arXiv:0704.2375},
year={2007},
archivePrefix={arXiv},
eprint={0704.2375},
primaryClass={cs.IT math.IT}
} | buzzi2007power |
arxiv-98 | 0704.2383 | Power control and receiver design for energy efficiency in multipath CDMA channels with bandlimited waveforms | <|reference_start|>Power control and receiver design for energy efficiency in multipath CDMA channels with bandlimited waveforms: This paper is focused on the cross-layer design problem of joint multiuser detection and power control for energy-efficiency optimization in a wireless data network through a game-theoretic ... | arxiv | @article{buzzi2007power,
title={Power control and receiver design for energy efficiency in multipath
CDMA channels with bandlimited waveforms},
author={Stefano Buzzi, Valeria Massaro, and H. Vincent Poor},
journal={arXiv preprint arXiv:0704.2383},
year={2007},
archivePrefix={arXiv},
eprint={07... | buzzi2007power |
arxiv-99 | 0704.2386 | Bounded Pushdown dimension vs Lempel Ziv information density | <|reference_start|>Bounded Pushdown dimension vs Lempel Ziv information density: In this paper we introduce a variant of pushdown dimension called bounded pushdown (BPD) dimension, that measures the density of information contained in a sequence, relative to a BPD automata, i.e. a finite state machine equipped with an ... | arxiv | @article{albert2007bounded,
title={Bounded Pushdown dimension vs Lempel Ziv information density},
author={Pilar Albert, Elvira Mayordomo, and Philippe Moser},
journal={arXiv preprint arXiv:0704.2386},
year={2007},
archivePrefix={arXiv},
eprint={0704.2386},
primaryClass={cs.CC cs.IT math.IT}
... | albert2007bounded |
arxiv-100 | 0704.2448 | Light Logics and Optimal Reduction: Completeness and Complexity | <|reference_start|>Light Logics and Optimal Reduction: Completeness and Complexity: Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial (el... | arxiv | @article{baillot2007light,
title={Light Logics and Optimal Reduction: Completeness and Complexity},
author={Patrick Baillot, Paolo Coppola and Ugo Dal Lago},
journal={arXiv preprint arXiv:0704.2448},
year={2007},
archivePrefix={arXiv},
eprint={0704.2448},
primaryClass={cs.LO cs.PL}
} | baillot2007light |
End of preview. Expand in Data Studio
ScholarCopilot-Data-v1
| 🚀Project Page | 📖Paper | 🔗Github | 🤗Model | 🤗Demo |
ScholarCopilot-Data-v1 contains the corpus data and embedded vectors of Scholar Copilot. Scholar Copilot improves the academic writing process by seamlessly integrating automatic text completion and intelligent citation suggestions into a cohesive, human-in-the-loop AI-driven pipeline. Designed to enhance productivity and creativity, it provides researchers with high-quality text generation and precise citation recommendations powered by iterative and context-aware Retrieval-Augmented Generation (RAG).
The current version of Scholar Copilot leverages a state-of-the-art 7-billion-parameter language model (LLM) trained on the complete Arxiv full paper corpus. This unified model for retrieval and generation is adept at making context-sensitive decisions about when to cite, what to cite, and how to generate coherent content based on reference papers.
🌟 Key Features
- ** 📝 Next-3-Sentence Suggestions: Facilitates writing by predicting the next sentences with automatic retrieval and citation of relevant reference papers.
- ** 📚 Citation Suggestions on Demand: Provides precise, contextually appropriate paper citations whenever needed.
- ** ✨ Full Section Auto-Completion: Assists in brainstorming and drafting comprehensive paper content and structure.
The current version of ScholarCopilot primarily focuses on the introduction and related work sections of academic papers. We will support full-paper writing in future releases.
- Downloads last month
- 47