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-1701 | 0711.0114 | Geometric Spanners With Small Chromatic Number | <|reference_start|>Geometric Spanners With Small Chromatic Number: Given an integer $k \geq 2$, we consider the problem of computing the smallest real number $t(k)$ such that for each set $P$ of points in the plane, there exists a $t(k)$-spanner for $P$ that has chromatic number at most $k$. We prove that $t(2) = 3$, $... | arxiv | @article{bose2007geometric,
title={Geometric Spanners With Small Chromatic Number},
author={Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel
Smid and Norbert Zeh},
journal={arXiv preprint arXiv:0711.0114},
year={2007},
number={TR-07-15},
archivePrefix={arXiv},
eprint={0... | bose2007geometric |
arxiv-1702 | 0711.0128 | Security Analysis of a Remote User Authentication Scheme with Smart Cards | <|reference_start|>Security Analysis of a Remote User Authentication Scheme with Smart Cards: Yoon et al. proposed a new efficient remote user authentication scheme using smart cards to solve the security problems of W. C. Ku and S. M. Chen scheme. This paper reviews Yoon et al. scheme and then proves that the password... | arxiv | @article{kumar2007security,
title={Security Analysis of a Remote User Authentication Scheme with Smart
Cards},
author={Manoj Kumar},
journal={arXiv preprint arXiv:0711.0128},
year={2007},
archivePrefix={arXiv},
eprint={0711.0128},
primaryClass={cs.CR}
} | kumar2007security |
arxiv-1703 | 0711.0189 | A Tutorial on Spectral Clustering | <|reference_start|>A Tutorial on Spectral Clustering: In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algorithms such as the k... | arxiv | @article{von luxburg2007a,
title={A Tutorial on Spectral Clustering},
author={Ulrike von Luxburg},
journal={Statistics and Computing 17(4), 2007},
year={2007},
archivePrefix={arXiv},
eprint={0711.0189},
primaryClass={cs.DS cs.LG}
} | von luxburg2007a |
arxiv-1704 | 0711.0194 | Coinductive Proof Principles for Stochastic Processes | <|reference_start|>Coinductive Proof Principles for Stochastic Processes: We give an explicit coinduction principle for recursively-defined stochastic processes. The principle applies to any closed property, not just equality, and works even when solutions are not unique. The rule encapsulates low-level analytic argume... | arxiv | @article{kozen2007coinductive,
title={Coinductive Proof Principles for Stochastic Processes},
author={Dexter Kozen},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (November
12, 2007) lmcs:1098},
year={2007},
doi={10.2168/LMCS-3(4:8)2007},
archivePrefix={arXiv},
eprint={07... | kozen2007coinductive |
arxiv-1705 | 0711.0237 | Zero-rate feedback can achieve the empirical capacity | <|reference_start|>Zero-rate feedback can achieve the empirical capacity: The utility of limited feedback for coding over an individual sequence of DMCs is investigated. This study complements recent results showing how limited or noisy feedback can boost the reliability of communication. A strategy with fixed input di... | arxiv | @article{eswaran2007zero-rate,
title={Zero-rate feedback can achieve the empirical capacity},
author={Krishnan Eswaran, Anand D. Sarwate, Anant Sahai, and Michael Gastpar},
journal={arXiv preprint arXiv:0711.0237},
year={2007},
doi={10.1109/TIT.2009.2034779},
archivePrefix={arXiv},
eprint={0... | eswaran2007zero-rate |
arxiv-1706 | 0711.0251 | Faster Algorithms for Online Topological Ordering | <|reference_start|>Faster Algorithms for Online Topological Ordering: We present two algorithms for maintaining the topological order of a directed acyclic graph with n vertices, under an online edge insertion sequence of m edges. Efficient algorithms for online topological ordering have many applications, including on... | arxiv | @article{kavitha2007faster,
title={Faster Algorithms for Online Topological Ordering},
author={Telikepalli Kavitha and Rogers Mathew},
journal={arXiv preprint arXiv:0711.0251},
year={2007},
number={IISC-CSA-TR-2007-12},
archivePrefix={arXiv},
eprint={0711.0251},
primaryClass={cs.DS}
} | kavitha2007faster |
arxiv-1707 | 0711.0259 | Diversification in the Internet Economy:The Role of For-Profit Mediators | <|reference_start|>Diversification in the Internet Economy:The Role of For-Profit Mediators: We investigate market forces that would lead to the emergence of new classes of players in the sponsored search market. We report a 3-fold diversification triggered by two inherent features of the sponsored search market, namel... | arxiv | @article{singh2007diversification,
title={Diversification in the Internet Economy:The Role of For-Profit Mediators},
author={Sudhir Kumar Singh, Vwani P. Roychowdhury, Himawan Gunadhi, Behnam A.
Rezaei},
journal={arXiv preprint arXiv:0711.0259},
year={2007},
archivePrefix={arXiv},
eprint={0711... | singh2007diversification |
arxiv-1708 | 0711.0261 | Gradient Descent Bit Flipping Algorithms for Decoding LDPC Codes | <|reference_start|>Gradient Descent Bit Flipping Algorithms for Decoding LDPC Codes: A novel class of bit-flipping (BF) algorithms for decoding low-density parity-check (LDPC) codes is presented. The proposed algorithms, which are called gradient descent bit flipping (GDBF) algorithms, can be regarded as simplified gra... | arxiv | @article{wadayama2007gradient,
title={Gradient Descent Bit Flipping Algorithms for Decoding LDPC Codes},
author={Tadashi Wadayama, Keisuke Nakamura, Masayuki Yagita, Yuuki Funahashi,
Shogo Usami, Ichi Takumi},
journal={arXiv preprint arXiv:0711.0261},
year={2007},
archivePrefix={arXiv},
eprint... | wadayama2007gradient |
arxiv-1709 | 0711.0277 | Bandwidth Partitioning in Decentralized Wireless Networks | <|reference_start|>Bandwidth Partitioning in Decentralized Wireless Networks: This paper addresses the following question, which is of interest in the design of a multiuser decentralized network. Given a total system bandwidth of W Hz and a fixed data rate constraint of R bps for each transmission, how many frequency s... | arxiv | @article{jindal2007bandwidth,
title={Bandwidth Partitioning in Decentralized Wireless Networks},
author={Nihar Jindal, Jeffrey G. Andrews, Steven Weber},
journal={arXiv preprint arXiv:0711.0277},
year={2007},
doi={10.1109/T-WC.2008.071220},
archivePrefix={arXiv},
eprint={0711.0277},
prim... | jindal2007bandwidth |
arxiv-1710 | 0711.0301 | Throughput Optimal On-Line Algorithms for Advanced Resource Reservation in Ultra High-Speed Networks | <|reference_start|>Throughput Optimal On-Line Algorithms for Advanced Resource Reservation in Ultra High-Speed Networks: Advanced channel reservation is emerging as an important feature of ultra high-speed networks requiring the transfer of large files. Applications include scientific data transfers and database backup... | arxiv | @article{cohen2007throughput,
title={Throughput Optimal On-Line Algorithms for Advanced Resource Reservation
in Ultra High-Speed Networks},
author={Reuven Cohen, Niloofar Fazlollahi and David Starobinski},
journal={arXiv preprint arXiv:0711.0301},
year={2007},
archivePrefix={arXiv},
eprint={07... | cohen2007throughput |
arxiv-1711 | 0711.0311 | Improving the LP bound of a MILP by branching concurrently | <|reference_start|>Improving the LP bound of a MILP by branching concurrently: We'll measure the differences of the dual variables and the gain of the objective function when creating new problems, which each has one inequality more than the starting LP-instance. These differences of the dual variables are naturally co... | arxiv | @article{buesching2007improving,
title={Improving the LP bound of a MILP by branching concurrently},
author={H. Georg Buesching},
journal={arXiv preprint arXiv:0711.0311},
year={2007},
archivePrefix={arXiv},
eprint={0711.0311},
primaryClass={cs.DM cs.DS}
} | buesching2007improving |
arxiv-1712 | 0711.0314 | Resource and Application Models for Advanced Grid Schedulers | <|reference_start|>Resource and Application Models for Advanced Grid Schedulers: As Grid computing is becoming an inevitable future, managing, scheduling and monitoring dynamic, heterogeneous resources will present new challenges. Solutions will have to be agile and adaptive, support self-organization and autonomous ma... | arxiv | @article{lazarevic2007resource,
title={Resource and Application Models for Advanced Grid Schedulers},
author={Aleksandar Lazarevic, Lionel Sacks},
journal={London Communications Symposium 2003},
year={2007},
archivePrefix={arXiv},
eprint={0711.0314},
primaryClass={cs.DC}
} | lazarevic2007resource |
arxiv-1713 | 0711.0315 | Measuring and Monitoring Grid Resource Utilisation | <|reference_start|>Measuring and Monitoring Grid Resource Utilisation: Effective resource utilisation monitoring and highly granular yet adaptive measurements are prerequisites for a more efficient Grid scheduler. We present a suite of measurement applications able to monitor per-process resource utilisation, and a cus... | arxiv | @article{lazarevic2007measuring,
title={Measuring and Monitoring Grid Resource Utilisation},
author={Aleksandar Lazarevic, Lionel Sacks},
journal={London Communications Symposium 2004},
year={2007},
archivePrefix={arXiv},
eprint={0711.0315},
primaryClass={cs.DC}
} | lazarevic2007measuring |
arxiv-1714 | 0711.0316 | A Study of Grid Applications: Scheduling Perspective | <|reference_start|>A Study of Grid Applications: Scheduling Perspective: As the Grid evolves from a high performance cluster middleware to a multipurpose utility computing framework, a good understanding of Grid applications, their statistics and utilisation patterns is required. This study looks at job execution times... | arxiv | @article{lazarevic2007a,
title={A Study of Grid Applications: Scheduling Perspective},
author={Aleksandar Lazarevic, Lionel Sacks},
journal={London Communications Symposium 2005},
year={2007},
archivePrefix={arXiv},
eprint={0711.0316},
primaryClass={cs.DC}
} | lazarevic2007a |
arxiv-1715 | 0711.0325 | Self-Organising management of Grid environments | <|reference_start|>Self-Organising management of Grid environments: This paper presents basic concepts, architectural principles and algorithms for efficient resource and security management in cluster computing environments and the Grid. The work presented in this paper is funded by BTExacT and the EPSRC project SO-GR... | arxiv | @article{liabotis2007self-organising,
title={Self-Organising management of Grid environments},
author={Ioannis Liabotis, Ognjen Prnjat, Tope Olukemi, Adrian Li Mow Ching,
Aleksandar Lazarevic, Lionel Sacks, Mike Fisher, Paul McKee},
journal={International Symposium on Telecommunications 2003},
year={2... | liabotis2007self-organising |
arxiv-1716 | 0711.0326 | Enabling Adaptive Grid Scheduling and Resource Management | <|reference_start|>Enabling Adaptive Grid Scheduling and Resource Management: Wider adoption of the Grid concept has led to an increasing amount of federated computational, storage and visualisation resources being available to scientists and researchers. Distributed and heterogeneous nature of these resources renders ... | arxiv | @article{lazarevic2007enabling,
title={Enabling Adaptive Grid Scheduling and Resource Management},
author={Aleksandar Lazarevic, Lionel Sacks, Ognjen Prnjat},
journal={International Symposium on Integrated Network Management 2005},
year={2007},
archivePrefix={arXiv},
eprint={0711.0326},
prim... | lazarevic2007enabling |
arxiv-1717 | 0711.0327 | Managing Uncertainty: A Case for Probabilistic Grid Scheduling | <|reference_start|>Managing Uncertainty: A Case for Probabilistic Grid Scheduling: The Grid technology is evolving into a global, service-orientated architecture, a universal platform for delivering future high demand computational services. Strong adoption of the Grid and the utility computing concept is leading to an... | arxiv | @article{lazarevic2007managing,
title={Managing Uncertainty: A Case for Probabilistic Grid Scheduling},
author={Aleksandar Lazarevic, Lionel Sacks, Ognjen Prnjat},
journal={arXiv preprint arXiv:0711.0327},
year={2007},
archivePrefix={arXiv},
eprint={0711.0327},
primaryClass={cs.DC}
} | lazarevic2007managing |
arxiv-1718 | 0711.0344 | Automatic Coding Rule Conformance Checking Using Logic Programs | <|reference_start|>Automatic Coding Rule Conformance Checking Using Logic Programs: Some approaches to increasing program reliability involve a disciplined use of programming languages so as to minimise the hazards introduced by error-prone features. This is realised by writing code that is constrained to a subset of t... | arxiv | @article{marpons-ucero2007automatic,
title={Automatic Coding Rule Conformance Checking Using Logic Programs},
author={Guillem Marpons-Ucero, Julio Mari~no, 'Angel Herranz, Lars-{AA}ke
Fredlund, Manuel Carro, Juan Jos'e Moreno-Navarro},
journal={arXiv preprint arXiv:0711.0344},
year={2007},
archive... | marpons-ucero2007automatic |
arxiv-1719 | 0711.0345 | A Prolog-based Environment for Reasoning about Programming Languages (Extended abstract) | <|reference_start|>A Prolog-based Environment for Reasoning about Programming Languages (Extended abstract): ECLAIR is a Prolog-based prototype system aiming to provide a functionally complete environment for the study, development and evaluation of programming language analysis and implementation tools. In this paper,... | arxiv | @article{bagnara2007a,
title={A Prolog-based Environment for Reasoning about Programming Languages
(Extended abstract)},
author={Roberto Bagnara, Patricia Hill, Enea Zaffanella},
journal={arXiv preprint arXiv:0711.0345},
year={2007},
archivePrefix={arXiv},
eprint={0711.0345},
primaryClass=... | bagnara2007a |
arxiv-1720 | 0711.0348 | Compiling ER Specifications into Declarative Programs | <|reference_start|>Compiling ER Specifications into Declarative Programs: This paper proposes an environment to support high-level database programming in a declarative programming language. In order to ensure safe database updates, all access and update operations related to the database are generated from high-level ... | arxiv | @article{braßel2007compiling,
title={Compiling ER Specifications into Declarative Programs},
author={Bernd Bra{ss}el, Michael Hanus and Marion Muller},
journal={arXiv preprint arXiv:0711.0348},
year={2007},
archivePrefix={arXiv},
eprint={0711.0348},
primaryClass={cs.PL cs.SE}
} | braßel2007compiling |
arxiv-1721 | 0711.0350 | Intermittent estimation of stationary time series | <|reference_start|>Intermittent estimation of stationary time series: Let $\{X_n\}_{n=0}^{\infty}$ be a stationary real-valued time series with unknown distribution. Our goal is to estimate the conditional expectation of $X_{n+1}$ based on the observations $X_i$, $0\le i\le n$ in a strongly consistent way. Bailey and R... | arxiv | @article{morvai2007intermittent,
title={Intermittent estimation of stationary time series},
author={G. Morvai and B. Weiss},
journal={Test 13 (2004), no. 2, 525--542},
year={2007},
archivePrefix={arXiv},
eprint={0711.0350},
primaryClass={math.PR cs.IT math.IT}
} | morvai2007intermittent |
arxiv-1722 | 0711.0351 | Noise threshold for universality of 2-input gates | <|reference_start|>Noise threshold for universality of 2-input gates: Evans and Pippenger showed in 1998 that noisy gates with 2 inputs are universal for arbitrary computation (i.e. can compute any function with bounded error), if all gates fail independently with probability epsilon and epsilon<theta, where theta is r... | arxiv | @article{unger2007noise,
title={Noise threshold for universality of 2-input gates},
author={Falk Unger},
journal={arXiv preprint arXiv:0711.0351},
year={2007},
archivePrefix={arXiv},
eprint={0711.0351},
primaryClass={cs.IT cs.CC math.IT}
} | unger2007noise |
arxiv-1723 | 0711.0366 | Shannon Theoretic Limits on Noisy Compressive Sampling | <|reference_start|>Shannon Theoretic Limits on Noisy Compressive Sampling: In this paper, we study the number of measurements required to recover a sparse signal in ${\mathbb C}^M$ with $L$ non-zero coefficients from compressed samples in the presence of noise. For a number of different recovery criteria, we prove that... | arxiv | @article{akçakaya2007shannon,
title={Shannon Theoretic Limits on Noisy Compressive Sampling},
author={Mehmet Akc{c}akaya and Vahid Tarokh},
journal={arXiv preprint arXiv:0711.0366},
year={2007},
archivePrefix={arXiv},
eprint={0711.0366},
primaryClass={cs.IT math.IT}
} | akçakaya2007shannon |
arxiv-1724 | 0711.0367 | Nonparametric inference for ergodic, stationary time series | <|reference_start|>Nonparametric inference for ergodic, stationary time series: The setting is a stationary, ergodic time series. The challenge is to construct a sequence of functions, each based on only finite segments of the past, which together provide a strongly consistent estimator for the conditional probability ... | arxiv | @article{morvai2007nonparametric,
title={Nonparametric inference for ergodic, stationary time series},
author={G. Morvai, S. Yakowitz, and L. Gyorfi},
journal={Ann. Statist. 24 (1996), no. 1, 370--379},
year={2007},
archivePrefix={arXiv},
eprint={0711.0367},
primaryClass={math.PR cs.IT math.... | morvai2007nonparametric |
arxiv-1725 | 0711.0436 | An example of algebraization of analysis and Fibonacci cobweb poset characterization | <|reference_start|>An example of algebraization of analysis and Fibonacci cobweb poset characterization: In recent Kwasniewski's papers inspired by O. V. Viskov it was shown that the $\psi$-calculus in parts appears to be almost automatic, natural extension of classical operator calculus of Rota - Mullin or equivalentl... | arxiv | @article{krot-sieniawska2007an,
title={An example of algebraization of analysis and Fibonacci cobweb poset
characterization},
author={Ewa Krot-Sieniawska},
journal={arXiv preprint arXiv:0711.0436},
year={2007},
archivePrefix={arXiv},
eprint={0711.0436},
primaryClass={math.CO cs.DM math.GM}... | krot-sieniawska2007an |
arxiv-1726 | 0711.0471 | Prediction for discrete time series | <|reference_start|>Prediction for discrete time series: Let $\{X_n\}$ be a stationary and ergodic time series taking values from a finite or countably infinite set ${\cal X}$. Assume that the distribution of the process is otherwise unknown. We propose a sequence of stopping times $\lambda_n$ along which we will be abl... | arxiv | @article{morvai2007prediction,
title={Prediction for discrete time series},
author={G. Morvai and B. Weiss},
journal={Probab. Theory Related Fields 132 (2005), no. 1, 1--12},
year={2007},
archivePrefix={arXiv},
eprint={0711.0471},
primaryClass={math.PR cs.IT math.IT}
} | morvai2007prediction |
arxiv-1727 | 0711.0472 | Order estimation of Markov chains | <|reference_start|>Order estimation of Markov chains: We describe estimators $\chi_n(X_0,X_1,...,X_n)$, which when applied to an unknown stationary process taking values from a countable alphabet ${\cal X}$, converge almost surely to $k$ in case the process is a $k$-th order Markov chain and to infinity otherwise.<|ref... | arxiv | @article{morvai2007order,
title={Order estimation of Markov chains},
author={G. Morvai and B. Weiss},
journal={IEEE Trans. Inform. Theory 51 (2005), no. 4, 1496--1497},
year={2007},
archivePrefix={arXiv},
eprint={0711.0472},
primaryClass={math.PR cs.IT math.IT}
} | morvai2007order |
arxiv-1728 | 0711.0486 | Triangular Peg Solitaire Unlimited | <|reference_start|>Triangular Peg Solitaire Unlimited: Triangular peg solitaire is a well-known one-person game or puzzle. When one peg captures many pegs consecutively, this is called a sweep. We investigate whether the game can end in a dramatic fashion, with one peg sweeping all remaining pegs off the board. For tri... | arxiv | @article{bell2007triangular,
title={Triangular Peg Solitaire Unlimited},
author={George I. Bell},
journal={The Games and Puzzles Journal, Issue 36, November-December 2004
http://gpj.connectfree.co.uk/gpjr.htm},
year={2007},
archivePrefix={arXiv},
eprint={0711.0486},
primaryClass={math.CO c... | bell2007triangular |
arxiv-1729 | 0711.0528 | Web-based Interface in Public Cluster | <|reference_start|>Web-based Interface in Public Cluster: A web-based interface dedicated for cluster computer which is publicly accessible for free is introduced. The interface plays an important role to enable secure public access, while providing user-friendly computational environment for end-users and easy maintai... | arxiv | @article{akbar2007web-based,
title={Web-based Interface in Public Cluster},
author={Z. Akbar and L.T. Handoko},
journal={arXiv preprint arXiv:0711.0528},
year={2007},
number={FISIKALIPI-07016},
archivePrefix={arXiv},
eprint={0711.0528},
primaryClass={cs.DC cs.CY}
} | akbar2007web-based |
arxiv-1730 | 0711.0538 | Spreadsheet Engineering: A Research Framework | <|reference_start|>Spreadsheet Engineering: A Research Framework: Spreadsheet engineering adapts the lessons of software engineering to spreadsheets, providing eight principles as a framework for organizing spreadsheet programming recommendations. Spreadsheets raise issues inadequately addressed by software engineering... | arxiv | @article{grossman2007spreadsheet,
title={Spreadsheet Engineering: A Research Framework},
author={Thomas A. Grossman},
journal={Proc. European Spreadsheet Risks Int. Grp. 2002 23-34 ISBN 1 86166
182 7},
year={2007},
archivePrefix={arXiv},
eprint={0711.0538},
primaryClass={cs.SE}
} | grossman2007spreadsheet |
arxiv-1731 | 0711.0557 | Kerdock Codes for Limited Feedback Precoded MIMO Systems | <|reference_start|>Kerdock Codes for Limited Feedback Precoded MIMO Systems: A codebook based limited feedback strategy is a practical way to obtain partial channel state information at the transmitter in a precoded multiple-input multiple-output (MIMO) wireless system. Conventional codebook designs use Grassmannian pa... | arxiv | @article{inoue2007kerdock,
title={Kerdock Codes for Limited Feedback Precoded MIMO Systems},
author={Takao Inoue and Robert W. Heath Jr},
journal={arXiv preprint arXiv:0711.0557},
year={2007},
archivePrefix={arXiv},
eprint={0711.0557},
primaryClass={cs.IT math.IT}
} | inoue2007kerdock |
arxiv-1732 | 0711.0574 | Singular Curves in the Joint Space and Cusp Points of 3-RPR parallel manipulators | <|reference_start|>Singular Curves in the Joint Space and Cusp Points of 3-RPR parallel manipulators: This paper investigates the singular curves in the joint space of a family of planar parallel manipulators. It focuses on special points, referred to as cusp points, which may appear on these curves. Cusp points play a... | arxiv | @article{zein2007singular,
title={Singular Curves in the Joint Space and Cusp Points of 3-RPR parallel
manipulators},
author={Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Robotica 25, 6 (2007) 717-724},
year={2007},
doi={10.1017/S0263574707003785},
archiveP... | zein2007singular |
arxiv-1733 | 0711.0607 | Exploring the Composition of Unit Test Suites | <|reference_start|>Exploring the Composition of Unit Test Suites: In agile software development, test code can considerably contribute to the overall source code size. Being a valuable asset both in terms of verification and documentation, the composition of a test suite needs to be well understood in order to identify... | arxiv | @article{van rompaey2007exploring,
title={Exploring the Composition of Unit Test Suites},
author={Bart Van Rompaey and Serge Demeyer},
journal={arXiv preprint arXiv:0711.0607},
year={2007},
number={UA TR2007-01},
archivePrefix={arXiv},
eprint={0711.0607},
primaryClass={cs.SE}
} | van rompaey2007exploring |
arxiv-1734 | 0711.0618 | PIDoc: Wiki style Literate Programming for Prolog | <|reference_start|>PIDoc: Wiki style Literate Programming for Prolog: This document introduces PlDoc, a literate programming system for Prolog. Starting point for PlDoc was minimal distraction from the programming task and maximal immediate reward, attempting to seduce the programmer to use the system. Minimal distract... | arxiv | @article{wielemaker2007pidoc:,
title={PIDoc: Wiki style Literate Programming for Prolog},
author={Jan Wielemaker, Anjo Anjewierden},
journal={arXiv preprint arXiv:0711.0618},
year={2007},
archivePrefix={arXiv},
eprint={0711.0618},
primaryClass={cs.PL cs.SE}
} | wielemaker2007pidoc: |
arxiv-1735 | 0711.0643 | A parallel gravitational N-body kernel | <|reference_start|>A parallel gravitational N-body kernel: We describe source code level parallelization for the {\tt kira} direct gravitational $N$-body integrator, the workhorse of the {\tt starlab} production environment for simulating dense stellar systems. The parallelization strategy, called ``j-parallelization''... | arxiv | @article{zwart2007a,
title={A parallel gravitational N-body kernel},
author={Simon Portegies Zwart (Amsterdam), Steve McMillan (Drexel), Derek
Groen (Amsterdam), Alessia Gualandris (Rochester), Michael Sipior (Astron),
Willem Vermin (SARA)},
journal={arXiv preprint arXiv:0711.0643},
year={2007},
... | zwart2007a |
arxiv-1736 | 0711.0666 | Discriminative Phoneme Sequences Extraction for Non-Native Speaker's Origin Classification | <|reference_start|>Discriminative Phoneme Sequences Extraction for Non-Native Speaker's Origin Classification: In this paper we present an automated method for the classification of the origin of non-native speakers. The origin of non-native speakers could be identified by a human listener based on the detection of typ... | arxiv | @article{bouselmi2007discriminative,
title={Discriminative Phoneme Sequences Extraction for Non-Native Speaker's
Origin Classification},
author={Ghazi Bouselmi (INRIA Lorraine - LORIA), Dominique Fohr (INRIA
Lorraine - LORIA), Irina Illina (INRIA Lorraine - LORIA), Jean-Paul Haton
(INRIA Lorraine - LORIA)... | bouselmi2007discriminative |
arxiv-1737 | 0711.0692 | On the defence notion | <|reference_start|>On the defence notion: 'Trojan horses', 'logic bombs', 'armoured viruses' and 'cryptovirology' are terms recalling war gears. In fact, concepts of attack and defence drive the world of computer virology, which looks like a war universe in an information society. This war has several shapes, from inva... | arxiv | @article{bonfante2007on,
title={On the defence notion},
author={Anne Bonfante (INRIA Lorraine - LORIA), Jean-Yves Marion (INRIA
Lorraine - LORIA)},
journal={Journal in Computer Virology 3, 4 (2007) 247-251},
year={2007},
doi={10.1007/s11416-007-0058-9},
archivePrefix={arXiv},
eprint={0711.... | bonfante2007on |
arxiv-1738 | 0711.0694 | Performance Bounds for Lambda Policy Iteration and Application to the Game of Tetris | <|reference_start|>Performance Bounds for Lambda Policy Iteration and Application to the Game of Tetris: We consider the discrete-time infinite-horizon optimal control problem formalized by Markov Decision Processes. We revisit the work of Bertsekas and Ioffe, that introduced $\lambda$ Policy Iteration, a family of alg... | arxiv | @article{scherrer2007performance,
title={Performance Bounds for Lambda Policy Iteration and Application to the
Game of Tetris},
author={Bruno Scherrer (INRIA Lorraine - LORIA)},
journal={arXiv preprint arXiv:0711.0694},
year={2007},
archivePrefix={arXiv},
eprint={0711.0694},
primaryClass={... | scherrer2007performance |
arxiv-1739 | 0711.0705 | Feedback Capacity of the Compound Channel | <|reference_start|>Feedback Capacity of the Compound Channel: In this work we find the capacity of a compound finite-state channel with time-invariant deterministic feedback. The model we consider involves the use of fixed length block codes. Our achievability result includes a proof of the existence of a universal dec... | arxiv | @article{shrader2007feedback,
title={Feedback Capacity of the Compound Channel},
author={Brooke Shrader, Haim Permuter},
journal={arXiv preprint arXiv:0711.0705},
year={2007},
doi={10.1109/TIT.2009.2023727},
archivePrefix={arXiv},
eprint={0711.0705},
primaryClass={cs.IT math.IT}
} | shrader2007feedback |
arxiv-1740 | 0711.0708 | A Rank-Metric Approach to Error Control in Random Network Coding | <|reference_start|>A Rank-Metric Approach to Error Control in Random Network Coding: The problem of error control in random linear network coding is addressed from a matrix perspective that is closely related to the subspace perspective of K\"otter and Kschischang. A large class of constant-dimension subspace codes is ... | arxiv | @article{silva2007a,
title={A Rank-Metric Approach to Error Control in Random Network Coding},
author={Danilo Silva, Frank R. Kschischang, Ralf K"otter},
journal={IEEE Transactions on Information Theory, vol. 54, no. 9, pp.
3951-3967, Sep. 2008},
year={2007},
doi={10.1109/TIT.2008.928291},
arc... | silva2007a |
arxiv-1741 | 0711.0711 | Information-Theoretic Security in Wireless Networks | <|reference_start|>Information-Theoretic Security in Wireless Networks: This paper summarizes recent contributions of the authors and their co-workers in the area of information-theoretic security.<|reference_end|> | arxiv | @article{liang2007information-theoretic,
title={Information-Theoretic Security in Wireless Networks},
author={Yingbin Liang, H. Vincent Poor and Shlomo Shamai (Shitz)},
journal={arXiv preprint arXiv:0711.0711},
year={2007},
archivePrefix={arXiv},
eprint={0711.0711},
primaryClass={cs.IT cs.CR... | liang2007information-theoretic |
arxiv-1742 | 0711.0784 | Addendum to Research MMMCV; A Man/Microbio/Megabio/Computer Vision | <|reference_start|>Addendum to Research MMMCV; A Man/Microbio/Megabio/Computer Vision: In October 2007, a Research Proposal for the University of Sydney, Australia, the author suggested that biovie-physical phenomenon as `electrodynamic dependant biological vision', is governed by relativistic quantum laws and biovisio... | arxiv | @article{alipour2007addendum,
title={Addendum to Research MMMCV; A Man/Microbio/Megabio/Computer Vision},
author={Philip B. Alipour},
journal={arXiv preprint arXiv:0711.0784},
year={2007},
archivePrefix={arXiv},
eprint={0711.0784},
primaryClass={cs.CV cs.CE}
} | alipour2007addendum |
arxiv-1743 | 0711.0811 | Combined Acoustic and Pronunciation Modelling for Non-Native Speech Recognition | <|reference_start|>Combined Acoustic and Pronunciation Modelling for Non-Native Speech Recognition: In this paper, we present several adaptation methods for non-native speech recognition. We have tested pronunciation modelling, MLLR and MAP non-native pronunciation adaptation and HMM models retraining on the HIWIRE for... | arxiv | @article{bouselmi2007combined,
title={Combined Acoustic and Pronunciation Modelling for Non-Native Speech
Recognition},
author={Ghazi Bouselmi (INRIA Lorraine - LORIA), Dominique Fohr (INRIA
Lorraine - LORIA), Irina Illina (INRIA Lorraine - LORIA)},
journal={Dans InterSpeech 2007 (2007)},
year={2007... | bouselmi2007combined |
arxiv-1744 | 0711.0829 | Instruction sequences with indirect jumps | <|reference_start|>Instruction sequences with indirect jumps: We study sequential programs that are instruction sequences with direct and indirect jump instructions. The intuition is that indirect jump instructions are jump instructions where the position of the instruction to jump to is the content of some memory cell... | arxiv | @article{bergstra2007instruction,
title={Instruction sequences with indirect jumps},
author={J. A. Bergstra, C. A. Middelburg},
journal={Scientific Annals of Computer Science, 17:19--46, 2007.
http://www.infoiasi.ro/bin/download/Annals/XVII/XVII_1.pdf},
year={2007},
number={PRG0709},
archivePr... | bergstra2007instruction |
arxiv-1745 | 0711.0834 | An interface group for process components | <|reference_start|>An interface group for process components: We take a process component as a pair of an interface and a behaviour. We study the composition of interacting process components in the setting of process algebra. We formalize the interfaces of interacting process components by means of an interface group.... | arxiv | @article{bergstra2007an,
title={An interface group for process components},
author={J. A. Bergstra, C. A. Middelburg},
journal={Fundamenta Informaticae, 99(4):355--382, 2010},
year={2007},
doi={10.3233/FI-2010-254},
number={PRG0707},
archivePrefix={arXiv},
eprint={0711.0834},
primary... | bergstra2007an |
arxiv-1746 | 0711.0836 | Machine structure oriented control code logic | <|reference_start|>Machine structure oriented control code logic: Control code is a concept that is closely related to a frequently occurring practitioner's view on what is a program: code that is capable of controlling the behaviour of some machine. We present a logical approach to explain issues concerning control co... | arxiv | @article{bergstra2007machine,
title={Machine structure oriented control code logic},
author={J. A. Bergstra, C. A. Middelburg},
journal={Acta Informatica, 46(5):375--401, 2009},
year={2007},
doi={10.1007/s00236-009-0099-2},
number={PRG0704},
archivePrefix={arXiv},
eprint={0711.0836},
... | bergstra2007machine |
arxiv-1747 | 0711.0838 | On the operating unit size of load/store architectures | <|reference_start|>On the operating unit size of load/store architectures: We introduce a strict version of the concept of a load/store instruction set architecture in the setting of Maurer machines. We take the view that transformations on the states of a Maurer machine are achieved by applying threads as considered i... | arxiv | @article{bergstra2007on,
title={On the operating unit size of load/store architectures},
author={J. A. Bergstra, C. A. Middelburg},
journal={Mathematical Structures in Computer Science, 20(3):395--417, 2010},
year={2007},
doi={10.1017/S0960129509990314},
number={PRG0703},
archivePrefix={arXi... | bergstra2007on |
arxiv-1748 | 0711.0840 | A thread calculus with molecular dynamics | <|reference_start|>A thread calculus with molecular dynamics: We present a theory of threads, interleaving of threads, and interaction between threads and services with features of molecular dynamics, a model of computation that bears on computations in which dynamic data structures are involved. Threads can interact w... | arxiv | @article{bergstra2007a,
title={A thread calculus with molecular dynamics},
author={J. A. Bergstra, C. A. Middelburg},
journal={Information and Computation, 208(7):817-844, 2010},
year={2007},
doi={10.1016/j.ic.2010.01.004},
archivePrefix={arXiv},
eprint={0711.0840},
primaryClass={cs.LO}
... | bergstra2007a |
arxiv-1749 | 0711.0892 | Routing in Outer Space: Improved Security and Energy-Efficiency in Multi-Hop Wireless Networks | <|reference_start|>Routing in Outer Space: Improved Security and Energy-Efficiency in Multi-Hop Wireless Networks: In this paper we consider security-related and energy-efficiency issues in multi-hop wireless networks. We start our work from the observation, known in the literature, that shortest path routing creates c... | arxiv | @article{mei2007routing,
title={Routing in Outer Space: Improved Security and Energy-Efficiency in
Multi-Hop Wireless Networks},
author={Alessandro Mei and Julinda Stefa},
journal={arXiv preprint arXiv:0711.0892},
year={2007},
archivePrefix={arXiv},
eprint={0711.0892},
primaryClass={cs.NI}... | mei2007routing |
arxiv-1750 | 0711.0917 | SWI-Prolog and the Web | <|reference_start|>SWI-Prolog and the Web: Where Prolog is commonly seen as a component in a Web application that is either embedded or communicates using a proprietary protocol, we propose an architecture where Prolog communicates to other components in a Web application using the standard HTTP protocol. By avoiding e... | arxiv | @article{wielemaker2007swi-prolog,
title={SWI-Prolog and the Web},
author={Jan Wielemaker, Zhisheng Huang and Lourens van der Meij},
journal={arXiv preprint arXiv:0711.0917},
year={2007},
archivePrefix={arXiv},
eprint={0711.0917},
primaryClass={cs.PL cs.SC}
} | wielemaker2007swi-prolog |
arxiv-1751 | 0711.1016 | An On-the-fly Tableau-based Decision Procedure for PDL-Satisfiability | <|reference_start|>An On-the-fly Tableau-based Decision Procedure for PDL-Satisfiability: We present a tableau-based algorithm for deciding satisfiability for propositional dynamic logic (PDL) which builds a finite rooted tree with ancestor loops and passes extra information from children to parents to separate good lo... | arxiv | @article{abate2007an,
title={An On-the-fly Tableau-based Decision Procedure for PDL-Satisfiability},
author={Pietro Abate, Rajeev Gor'e and Florian Widmann},
journal={arXiv preprint arXiv:0711.1016},
year={2007},
archivePrefix={arXiv},
eprint={0711.1016},
primaryClass={cs.LO}
} | abate2007an |
arxiv-1752 | 0711.1038 | Am\'elioration des Performances des Syst\`emes Automatiques de Reconnaissance de la Parole pour la Parole Non Native | <|reference_start|>Am\'elioration des Performances des Syst\`emes Automatiques de Reconnaissance de la Parole pour la Parole Non Native: In this article, we present an approach for non native automatic speech recognition (ASR). We propose two methods to adapt existing ASR systems to the non-native accents. The first me... | arxiv | @article{bouselmi2007am\'elioration,
title={Am\'elioration des Performances des Syst\`emes Automatiques de
Reconnaissance de la Parole pour la Parole Non Native},
author={Ghazi Bouselmi (INRIA Lorraine - LORIA), Dominique Fohr (INRIA
Lorraine - LORIA), Irina Illina (INRIA Lorraine - LORIA), Jean-Paul Haton
... | bouselmi2007am\'elioration |
arxiv-1753 | 0711.1055 | Simple Recursive Games | <|reference_start|>Simple Recursive Games: We define the class of "simple recursive games". A simple recursive game is defined as a simple stochastic game (a notion due to Anne Condon), except that we allow arbitrary real payoffs but disallow moves of chance. We study the complexity of solving simple recursive games an... | arxiv | @article{andersson2007simple,
title={Simple Recursive Games},
author={Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen,
Troels Bjerre Sorensen},
journal={arXiv preprint arXiv:0711.1055},
year={2007},
archivePrefix={arXiv},
eprint={0711.1055},
primaryClass={cs.GT cs.DS}
} | andersson2007simple |
arxiv-1754 | 0711.1056 | Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe | <|reference_start|>Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe: This paper provides simple lower bounds on the number of iterations which is required for successful message-passing decoding of some important families of graph-based code ensembles (including low-density par... | arxiv | @article{sason2007bounds,
title={Bounds on the Number of Iterations for Turbo-Like Ensembles over the
Binary Erasure Channe},
author={Igal Sason and Gil Wiechman},
journal={arXiv preprint arXiv:0711.1056},
year={2007},
archivePrefix={arXiv},
eprint={0711.1056},
primaryClass={cs.IT math.IT}... | sason2007bounds |
arxiv-1755 | 0711.1161 | Joint Source-Channel Codes for MIMO Block Fading Channels | <|reference_start|>Joint Source-Channel Codes for MIMO Block Fading Channels: We consider transmission of a continuous amplitude source over an L-block Rayleigh fading $M_t \times M_r$ MIMO channel when the channel state information is only available at the receiver. Since the channel is not ergodic, Shannon's source-c... | arxiv | @article{gunduz2007joint,
title={Joint Source-Channel Codes for MIMO Block Fading Channels},
author={Deniz Gunduz, Elza Erkip},
journal={arXiv preprint arXiv:0711.1161},
year={2007},
archivePrefix={arXiv},
eprint={0711.1161},
primaryClass={cs.IT math.IT}
} | gunduz2007joint |
arxiv-1756 | 0711.1177 | Considerations on P vs NP | <|reference_start|>Considerations on P vs NP: In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set E(A) containing propositional cal... | arxiv | @article{von reckow2007considerations,
title={Considerations on P vs NP},
author={Alfredo von Reckow},
journal={arXiv preprint arXiv:0711.1177},
year={2007},
archivePrefix={arXiv},
eprint={0711.1177},
primaryClass={cs.CC cs.LO}
} | von reckow2007considerations |
arxiv-1757 | 0711.1189 | Clique Minors in Cartesian Products of Graphs | <|reference_start|>Clique Minors in Cartesian Products of Graphs: A "clique minor" in a graph G can be thought of as a set of connected subgraphs in G that are pairwise disjoint and pairwise adjacent. The "Hadwiger number" h(G) is the maximum cardinality of a clique minor in G. This paper studies clique minors in the C... | arxiv | @article{wood2007clique,
title={Clique Minors in Cartesian Products of Graphs},
author={David R. Wood},
journal={New York J. Mathematics 17:627-682, 2011},
year={2007},
archivePrefix={arXiv},
eprint={0711.1189},
primaryClass={math.CO cs.DM}
} | wood2007clique |
arxiv-1758 | 0711.1226 | Dynamic aspects of individual design activities A cognitive ergonomics viewpoint | <|reference_start|>Dynamic aspects of individual design activities A cognitive ergonomics viewpoint: This paper focuses on the use of knowledge possessed by designers. Data collection was based on observations (by the cognitive ergonomics researcher) and simultaneous verbalisations (by the designers) in empirical studi... | arxiv | @article{visser2007dynamic,
title={Dynamic aspects of individual design activities. A cognitive ergonomics
viewpoint},
author={Willemien Visser (INRIA Rocquencourt)},
journal={Human behaviour in design Springer Verlag (Ed.) (2003) 87-96},
year={2007},
archivePrefix={arXiv},
eprint={0711.1226},... | visser2007dynamic |
arxiv-1759 | 0711.1227 | Designing as Construction of Representations: A Dynamic Viewpoint in Cognitive Design Research | <|reference_start|>Designing as Construction of Representations: A Dynamic Viewpoint in Cognitive Design Research: This article presents a cognitively oriented viewpoint on design. It focuses on cognitive, dynamic aspects of real design, i.e., the actual cognitive activity implemented by designers during their work on ... | arxiv | @article{visser2007designing,
title={Designing as Construction of Representations: A Dynamic Viewpoint in
Cognitive Design Research},
author={Willemien Visser (INRIA Rocquencourt)},
journal={Human-Computer Interaction 21, 1 (2006) 103-152},
year={2007},
archivePrefix={arXiv},
eprint={0711.1227... | visser2007designing |
arxiv-1760 | 0711.1231 | Optimizing Latency and Reliability of Pipeline Workflow Applications | <|reference_start|>Optimizing Latency and Reliability of Pipeline Workflow Applications: Mapping applications onto heterogeneous platforms is a difficult challenge, even for simple application patterns such as pipeline graphs. The problem is even more complex when processors are subject to failure during the execution ... | arxiv | @article{benoit2007optimizing,
title={Optimizing Latency and Reliability of Pipeline Workflow Applications},
author={Anne Benoit (INRIA Rh^one-Alpes / LIP Laboratoire d'Informatique du
Parall'elisme, LIP), Veronika Rehn-Sonigo (INRIA Rh^one-Alpes / LIP
Laboratoire d'Informatique du Parall'elisme, LIP), Yves... | benoit2007optimizing |
arxiv-1761 | 0711.1242 | The Price of Selfish Stackelberg Leadership in a Network Game | <|reference_start|>The Price of Selfish Stackelberg Leadership in a Network Game: We study a class of games in which a finite number of agents each controls a quantity of flow to be routed through a network, and are able to split their own flow between multiple paths through the network. Recent work on this model has c... | arxiv | @article{goldberg2007the,
title={The Price of Selfish Stackelberg Leadership in a Network Game},
author={P.W. Goldberg, P. Polpinit},
journal={arXiv preprint arXiv:0711.1242},
year={2007},
archivePrefix={arXiv},
eprint={0711.1242},
primaryClass={cs.GT}
} | goldberg2007the |
arxiv-1762 | 0711.1269 | Fair Scheduling in OFDMA-based Wireless Systems with QoS Constraints | <|reference_start|>Fair Scheduling in OFDMA-based Wireless Systems with QoS Constraints: In this work we consider the problem of downlink resource allocation for proportional fairness of long term received rates of data users and quality of service for real time sessions in an OFDMA-based wireless system. The base stat... | arxiv | @article{girici2007fair,
title={Fair Scheduling in OFDMA-based Wireless Systems with QoS Constraints},
author={Tolga Girici, Chenxi Zhu, Jonathan R. Agre, Anthony Ephremides},
journal={International OFDM Workshop, Hamburg Germany on Aug. 30th 2007
(Inowo 07)},
year={2007},
archivePrefix={arXiv},
... | girici2007fair |
arxiv-1763 | 0711.1273 | Practical Resource Allocation Algorithms for QoS in OFDMA-based Wireless Systems | <|reference_start|>Practical Resource Allocation Algorithms for QoS in OFDMA-based Wireless Systems: In this work we propose an efficient resource allocation algorithm for OFDMA based wireless systems supporting heterogeneous traffic. The proposed algorithm provides proportionally fairness to data users and short term ... | arxiv | @article{girici2007practical,
title={Practical Resource Allocation Algorithms for QoS in OFDMA-based Wireless
Systems},
author={Tolga Girici, Chenxi Zhu, Jonathan R. Agre, Anthony Ephremides},
journal={To be presented at 2nd IEEE International Broadband Wireless
Access Workshop. Las Vegas, Nevada USA Ja... | girici2007practical |
arxiv-1764 | 0711.1290 | Conception individuelle et collective Approche de l'ergonomie cognitive [Individual and Collective Design The Cognitive-Ergonomics Approach] | <|reference_start|>Conception individuelle et collective Approche de l'ergonomie cognitive [Individual and Collective Design The Cognitive-Ergonomics Approach]: This text presents the cognitive-ergonomics approach to design, in both its individual and collective form. It focuses on collective design with respect to ind... | arxiv | @article{visser2007conception,
title={Conception individuelle et collective. Approche de l'ergonomie cognitive
[Individual and Collective Design. The Cognitive-Ergonomics Approach]},
author={Willemien Visser (INRIA Rocquencourt)},
journal={Cognition et cr\'eation. Explorations cognitives des processus de
... | visser2007conception |
arxiv-1765 | 0711.1295 | On the performance of Golden space-time trellis coded modulation over MIMO block fading channels | <|reference_start|>On the performance of Golden space-time trellis coded modulation over MIMO block fading channels: The Golden space-time trellis coded modulation (GST-TCM) scheme was proposed in \cite{Hong06} for a high rate $2\times 2$ multiple-input multiple-output (MIMO) system over slow fading channels. In this l... | arxiv | @article{viterbo2007on,
title={On the performance of Golden space-time trellis coded modulation over
MIMO block fading channels},
author={Emanuele Viterbo and Yi Hong},
journal={arXiv preprint arXiv:0711.1295},
year={2007},
archivePrefix={arXiv},
eprint={0711.1295},
primaryClass={cs.IT mat... | viterbo2007on |
arxiv-1766 | 0711.1360 | Analytical approach to bit-string models of language evolution | <|reference_start|>Analytical approach to bit-string models of language evolution: A formulation of bit-string models of language evolution, based on differential equations for the population speaking each language, is introduced and preliminarily studied. Connections with replicator dynamics and diffusion processes ar... | arxiv | @article{zanette2007analytical,
title={Analytical approach to bit-string models of language evolution},
author={Damian H. Zanette},
journal={arXiv preprint arXiv:0711.1360},
year={2007},
doi={10.1142/S0129183108012340},
archivePrefix={arXiv},
eprint={0711.1360},
primaryClass={physics.soc... | zanette2007analytical |
arxiv-1767 | 0711.1383 | On Minimal Tree Realizations of Linear Codes | <|reference_start|>On Minimal Tree Realizations of Linear Codes: A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization, i.e., a cycle-free realization of the code on the underlying tree, by spec... | arxiv | @article{kashyap2007on,
title={On Minimal Tree Realizations of Linear Codes},
author={Navin Kashyap},
journal={arXiv preprint arXiv:0711.1383},
year={2007},
doi={10.1109/TIT.2009.2023718},
archivePrefix={arXiv},
eprint={0711.1383},
primaryClass={cs.IT math.IT}
} | kashyap2007on |
arxiv-1768 | 0711.1401 | Towards a Sound Theory of Adaptation for the Simple Genetic Algorithm | <|reference_start|>Towards a Sound Theory of Adaptation for the Simple Genetic Algorithm: The pace of progress in the fields of Evolutionary Computation and Machine Learning is currently limited -- in the former field, by the improbability of making advantageous extensions to evolutionary algorithms when their capacity... | arxiv | @article{burjorjee2007towards,
title={Towards a Sound Theory of Adaptation for the Simple Genetic Algorithm},
author={Keki Burjorjee},
journal={arXiv preprint arXiv:0711.1401},
year={2007},
archivePrefix={arXiv},
eprint={0711.1401},
primaryClass={cs.NE cs.AI}
} | burjorjee2007towards |
arxiv-1769 | 0711.1466 | Predicting relevant empty spots in social interaction | <|reference_start|>Predicting relevant empty spots in social interaction: An empty spot refers to an empty hard-to-fill space which can be found in the records of the social interaction, and is the clue to the persons in the underlying social network who do not appear in the records. This contribution addresses a probl... | arxiv | @article{maeno2007predicting,
title={Predicting relevant empty spots in social interaction},
author={Yoshiharu Maeno and Yukio Ohsawa},
journal={Journal of Systems Science and Complexity vol.21, pp.161-171
(2008)},
year={2007},
archivePrefix={arXiv},
eprint={0711.1466},
primaryClass={cs.AI... | maeno2007predicting |
arxiv-1770 | 0711.1478 | A constructive Borel-Cantelli Lemma Constructing orbits with required statistical properties | <|reference_start|>A constructive Borel-Cantelli Lemma Constructing orbits with required statistical properties: In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively s... | arxiv | @article{galatolo2007a,
title={A constructive Borel-Cantelli Lemma. Constructing orbits with required
statistical properties},
author={Stefano Galatolo, Mathieu Hoyrup and Cristobal Rojas},
journal={arXiv preprint arXiv:0711.1478},
year={2007},
archivePrefix={arXiv},
eprint={0711.1478},
pr... | galatolo2007a |
arxiv-1771 | 0711.1533 | N3Logic: A Logical Framework For the World Wide Web | <|reference_start|>N3Logic: A Logical Framework For the World Wide Web: The Semantic Web drives towards the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the Semantic Web provides a unifying representation of richly structured d... | arxiv | @article{berners-lee2007n3logic:,
title={N3Logic: A Logical Framework For the World Wide Web},
author={Tim Berners-Lee, Dan Connolly, Lalana Kagal, Yosi Scharf, and Jim
Hendler},
journal={arXiv preprint arXiv:0711.1533},
year={2007},
archivePrefix={arXiv},
eprint={0711.1533},
primaryClass=... | berners-lee2007n3logic: |
arxiv-1772 | 0711.1565 | Channel Code Design with Causal Side Information at the Encoder | <|reference_start|>Channel Code Design with Causal Side Information at the Encoder: The problem of channel code design for the $M$-ary input AWGN channel with additive $Q$-ary interference where the sequence of i.i.d. interference symbols is known causally at the encoder is considered. The code design criterion at high... | arxiv | @article{farmanbar2007channel,
title={Channel Code Design with Causal Side Information at the Encoder},
author={Hamid Farmanbar, Shahab Oveis Gharan, and Amir Keyvan Khandani},
journal={arXiv preprint arXiv:0711.1565},
year={2007},
archivePrefix={arXiv},
eprint={0711.1565},
primaryClass={cs.... | farmanbar2007channel |
arxiv-1773 | 0711.1569 | Capacity as a Fundamental Metric for Mechanism Design in the Information Economy | <|reference_start|>Capacity as a Fundamental Metric for Mechanism Design in the Information Economy: The auction theory literature has so far focused mostly on the design of mechanisms that takes the revenue or the efficiency as a yardstick. However, scenarios where the {\it capacity}, which we define as \textit{``the ... | arxiv | @article{singh2007capacity,
title={Capacity as a Fundamental Metric for Mechanism Design in the Information
Economy},
author={Sudhir Kumar Singh, Vwani P. Roychowdhury},
journal={arXiv preprint arXiv:0711.1569},
year={2007},
archivePrefix={arXiv},
eprint={0711.1569},
primaryClass={cs.GT}
} | singh2007capacity |
arxiv-1774 | 0711.1573 | Outage-Efficient Downlink Transmission Without Transmit Channel State Information | <|reference_start|>Outage-Efficient Downlink Transmission Without Transmit Channel State Information: This paper investigates downlink transmission over a quasi-static fading Gaussian broadcast channel (BC), to model delay-sensitive applications over slowly time-varying fading channels. System performance is characteri... | arxiv | @article{zhang2007outage-efficient,
title={Outage-Efficient Downlink Transmission Without Transmit Channel State
Information},
author={Wenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Laneman},
journal={arXiv preprint arXiv:0711.1573},
year={2007},
archivePrefix={arXiv},
eprint={0711.1573},
... | zhang2007outage-efficient |
arxiv-1775 | 0711.1605 | Asymptotic Capacity of Wireless Ad Hoc Networks with Realistic Links under a Honey Comb Topology | <|reference_start|>Asymptotic Capacity of Wireless Ad Hoc Networks with Realistic Links under a Honey Comb Topology: We consider the effects of Rayleigh fading and lognormal shadowing in the physical interference model for all the successful transmissions of traffic across the network. New bounds are derived for the ca... | arxiv | @article{asnani2007asymptotic,
title={Asymptotic Capacity of Wireless Ad Hoc Networks with Realistic Links
under a Honey Comb Topology},
author={Himanshu Asnani and Abhay Karandikar},
journal={arXiv preprint arXiv:0711.1605},
year={2007},
archivePrefix={arXiv},
eprint={0711.1605},
primaryC... | asnani2007asymptotic |
arxiv-1776 | 0711.1669 | Applying Software Defect Estimations: Using a Risk Matrix for Tuning Test Effort | <|reference_start|>Applying Software Defect Estimations: Using a Risk Matrix for Tuning Test Effort: Applying software defect esimation techniques and presenting this information in a compact and impactful decision table can clearly illustrate to collaborative groups how critical this position is in the overall develop... | arxiv | @article{cusick2007applying,
title={Applying Software Defect Estimations: Using a Risk Matrix for Tuning
Test Effort},
author={James Cusick},
journal={arXiv preprint arXiv:0711.1669},
year={2007},
archivePrefix={arXiv},
eprint={0711.1669},
primaryClass={cs.SE cs.OH}
} | cusick2007applying |
arxiv-1777 | 0711.1682 | Data Structures for Mergeable Trees | <|reference_start|>Data Structures for Mergeable Trees: Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant requires merging two paths in a single operation. In contrast to the standard problem, in which only one... | arxiv | @article{georgiadis2007data,
title={Data Structures for Mergeable Trees},
author={Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robert E. Tarjan, Renato
F. Werneck},
journal={arXiv preprint arXiv:0711.1682},
year={2007},
archivePrefix={arXiv},
eprint={0711.1682},
primaryClass={cs.DS}
} | georgiadis2007data |
arxiv-1778 | 0711.1723 | An analysis of a random algorithm for estimating all the matchings | <|reference_start|>An analysis of a random algorithm for estimating all the matchings: Counting the number of all the matchings on a bipartite graph has been transformed into calculating the permanent of a matrix obtained from the extended bipartite graph by Yan Huo, and Rasmussen presents a simple approach (RM) to app... | arxiv | @article{zhang2007an,
title={An analysis of a random algorithm for estimating all the matchings},
author={Jinshan Zhang, Yan Huo, and Fengshan Bai},
journal={arXiv preprint arXiv:0711.1723},
year={2007},
archivePrefix={arXiv},
eprint={0711.1723},
primaryClass={cs.CC cs.DM}
} | zhang2007an |
arxiv-1779 | 0711.1765 | Kinematic calibration of orthoglide-type mechanisms | <|reference_start|>Kinematic calibration of orthoglide-type mechanisms: The paper proposes a novel calibration approach for the Orthoglide-type mechanisms based on observations of the manipulator leg parallelism during mo-tions between the prespecified test postures. It employs a low-cost measuring system composed of s... | arxiv | @article{pashkevich2007kinematic,
title={Kinematic calibration of orthoglide-type mechanisms},
author={Anatoly Pashkevich (ROBOTIC Laboratory, Irccyn), Damien Chablat
(IRCCyN), Philippe Wenger (IRCCyN)},
journal={Information Control Problems in Manufacturing 2006, Elsevier (Ed.)
(2006) 149-154},
yea... | pashkevich2007kinematic |
arxiv-1780 | 0711.1766 | Achieving the Gaussian Rate-Distortion Function by Prediction | <|reference_start|>Achieving the Gaussian Rate-Distortion Function by Prediction: The "water-filling" solution for the quadratic rate-distortion function of a stationary Gaussian source is given in terms of its power spectrum. This formula naturally lends itself to a frequency domain "test-channel" realization. We prov... | arxiv | @article{zamir2007achieving,
title={Achieving the Gaussian Rate-Distortion Function by Prediction},
author={Ram Zamir, Yuval Kochman and Uri Erez},
journal={arXiv preprint arXiv:0711.1766},
year={2007},
archivePrefix={arXiv},
eprint={0711.1766},
primaryClass={cs.IT math.IT}
} | zamir2007achieving |
arxiv-1781 | 0711.1786 | A Mobile Computing Architecture for Numerical Simulation | <|reference_start|>A Mobile Computing Architecture for Numerical Simulation: The domain of numerical simulation is a place where the parallelization of numerical code is common. The definition of a numerical context means the configuration of resources such as memory, processor load and communication graph, with an evo... | arxiv | @article{dumont2007a,
title={A Mobile Computing Architecture for Numerical Simulation},
author={Cyril Dumont (LACL), Fabrice Mourlin (LACL)},
journal={arXiv preprint arXiv:0711.1786},
year={2007},
archivePrefix={arXiv},
eprint={0711.1786},
primaryClass={cs.DC}
} | dumont2007a |
arxiv-1782 | 0711.1814 | Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming | <|reference_start|>Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming: Building rules on top of ontologies is the ultimate goal of the logical layer of the Semantic Web. To this aim an ad-hoc mark-up language for this layer is currently under discussion. It is intended to follow t... | arxiv | @article{lisi2007building,
title={Building Rules on Top of Ontologies for the Semantic Web with Inductive
Logic Programming},
author={Francesca A. Lisi},
journal={arXiv preprint arXiv:0711.1814},
year={2007},
archivePrefix={arXiv},
eprint={0711.1814},
primaryClass={cs.AI cs.LG}
} | lisi2007building |
arxiv-1783 | 0711.1827 | The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions | <|reference_start|>The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions: Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem with four colors is NP-complete, and they showed that the infinite... | arxiv | @article{baumeister2007the,
title={The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are
NP-Complete via Parsimonious Reductions},
author={Dorothea Baumeister and Joerg Rothe},
journal={arXiv preprint arXiv:0711.1827},
year={2007},
archivePrefix={arXiv},
eprint={0711.1827},
... | baumeister2007the |
arxiv-1784 | 0711.1856 | Testing Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications | <|reference_start|>Testing Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications: This note considers reciprocal of primes in binary representation and shows that the conjecture that 0s exceed 1s in most cases continues to hold for primes less one million. The conjecture has also been tested fo... | arxiv | @article{gangasani2007testing,
title={Testing Kak's Conjecture on Binary Reciprocal of Primes and
Cryptographic Applications},
author={Sumanth Kumar Reddy Gangasani},
journal={arXiv preprint arXiv:0711.1856},
year={2007},
archivePrefix={arXiv},
eprint={0711.1856},
primaryClass={cs.CR}
} | gangasani2007testing |
arxiv-1785 | 0711.1890 | A Geometric Interpretation of Fading in Wireless Networks: Theory and Applications | <|reference_start|>A Geometric Interpretation of Fading in Wireless Networks: Theory and Applications: In wireless networks with random node distribution, the underlying point process model and the channel fading process are usually considered separately. A unified framework is introduced that permits the geometric cha... | arxiv | @article{haenggi2007a,
title={A Geometric Interpretation of Fading in Wireless Networks: Theory and
Applications},
author={Martin Haenggi},
journal={arXiv preprint arXiv:0711.1890},
year={2007},
archivePrefix={arXiv},
eprint={0711.1890},
primaryClass={cs.IT math.IT}
} | haenggi2007a |
arxiv-1786 | 0711.1986 | Performance bounds and codes design criteria for channel decoding with a-priori information | <|reference_start|>Performance bounds and codes design criteria for channel decoding with a-priori information: In this article we focus on the problem of channel decoding in presence of a-priori information. In particular, assuming that the a-priori information reliability is not perfectly estimated at the receiver, w... | arxiv | @article{abrardo2007performance,
title={Performance bounds and codes design criteria for channel decoding with
a-priori information},
author={Andrea Abrardo},
journal={arXiv preprint arXiv:0711.1986},
year={2007},
archivePrefix={arXiv},
eprint={0711.1986},
primaryClass={cs.IT math.IT}
} | abrardo2007performance |
arxiv-1787 | 0711.1993 | Entropy of capacities on lattices and set systems | <|reference_start|>Entropy of capacities on lattices and set systems: We propose a definition for the entropy of capacities defined on lattices. Classical capacities are monotone set functions and can be seen as a generalization of probability measures. Capacities on lattices address the general case where the family o... | arxiv | @article{honda2007entropy,
title={Entropy of capacities on lattices and set systems},
author={Aoi Honda, Michel Grabisch (CES)},
journal={Information Sciences 176 (2006) 3472-3489},
year={2007},
archivePrefix={arXiv},
eprint={0711.1993},
primaryClass={cs.DM math.ST stat.TH}
} | honda2007entropy |
arxiv-1788 | 0711.2010 | A Polynomial Time Algorithm for Graph Isomorphism | <|reference_start|>A Polynomial Time Algorithm for Graph Isomorphism: We claimed that there is a polynomial algorithm to test if two graphs are isomorphic. But the algorithm is wrong. It only tests if the adjacency matrices of two graphs have the same eigenvalues. There is a counterexample of two non-isomorphic graphs ... | arxiv | @article{czerwinski2007a,
title={A Polynomial Time Algorithm for Graph Isomorphism},
author={Reiner Czerwinski},
journal={arXiv preprint arXiv:0711.2010},
year={2007},
archivePrefix={arXiv},
eprint={0711.2010},
primaryClass={cs.CC}
} | czerwinski2007a |
arxiv-1789 | 0711.2023 | Empirical Evaluation of Four Tensor Decomposition Algorithms | <|reference_start|>Empirical Evaluation of Four Tensor Decomposition Algorithms: Higher-order tensor decompositions are analogous to the familiar Singular Value Decomposition (SVD), but they transcend the limitations of matrices (second-order tensors). SVD is a powerful tool that has achieved impressive results in info... | arxiv | @article{turney2007empirical,
title={Empirical Evaluation of Four Tensor Decomposition Algorithms},
author={Peter D. Turney (National Research Council of Canada)},
journal={arXiv preprint arXiv:0711.2023},
year={2007},
number={ERB-1152, NRC-49877},
archivePrefix={arXiv},
eprint={0711.2023},
... | turney2007empirical |
arxiv-1790 | 0711.2050 | Two Families of Quantum Codes Derived from Cyclic Codes | <|reference_start|>Two Families of Quantum Codes Derived from Cyclic Codes: We characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we derive from these codes a family of pure quantum codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes is derived fro... | arxiv | @article{guenda2007two,
title={Two Families of Quantum Codes Derived from Cyclic Codes},
author={Kenza Guenda},
journal={arXiv preprint arXiv:0711.2050},
year={2007},
archivePrefix={arXiv},
eprint={0711.2050},
primaryClass={cs.IT math.IT}
} | guenda2007two |
arxiv-1791 | 0711.2058 | Computer Model of a "Sense of Humour" I General Algorithm | <|reference_start|>Computer Model of a "Sense of Humour" I General Algorithm: A computer model of a "sense of humour" is proposed. The humorous effect is interpreted as a specific malfunction in the course of information processing due to the need for the rapid deletion of the false version transmitted into consciousne... | arxiv | @article{suslov2007computer,
title={Computer Model of a "Sense of Humour". I. General Algorithm},
author={I. M. Suslov (P.L.Kapitza Institute for Physical Problems, Moscow,
Russia)},
journal={Biofizika SSSR 37, 318 (1992) [Biophysics 37, 242 (1992)]},
year={2007},
archivePrefix={arXiv},
eprint... | suslov2007computer |
arxiv-1792 | 0711.2061 | Computer Model of a "Sense of Humour" II Realization in Neural Networks | <|reference_start|>Computer Model of a "Sense of Humour" II Realization in Neural Networks: The computer realization of a "sense of humour" requires the creation of an algorithm for solving the "linguistic problem", i.e. the problem of recognizing a continuous sequence of polysemantic images. Such algorithm may be real... | arxiv | @article{suslov2007computer,
title={Computer Model of a "Sense of Humour". II. Realization in Neural
Networks},
author={I. M. Suslov (P.L.Kapitza Institute for Physical Problems, Moscow,
Russia)},
journal={Biofizika SSSR 37, 325 (1992) [Biophysics 37, 249 (1992)]},
year={2007},
archivePrefix={ar... | suslov2007computer |
arxiv-1793 | 0711.2062 | Autoregressive Time Series Forecasting of Computational Demand | <|reference_start|>Autoregressive Time Series Forecasting of Computational Demand: We study the predictive power of autoregressive moving average models when forecasting demand in two shared computational networks, PlanetLab and Tycoon. Demand in these networks is very volatile, and predictive techniques to plan usage ... | arxiv | @article{sandholm2007autoregressive,
title={Autoregressive Time Series Forecasting of Computational Demand},
author={Thomas Sandholm},
journal={arXiv preprint arXiv:0711.2062},
year={2007},
archivePrefix={arXiv},
eprint={0711.2062},
primaryClass={cs.DC}
} | sandholm2007autoregressive |
arxiv-1794 | 0711.2087 | Query Evaluation and Optimization in the Semantic Web | <|reference_start|>Query Evaluation and Optimization in the Semantic Web: We address the problem of answering Web ontology queries efficiently. An ontology is formalized as a Deductive Ontology Base (DOB), a deductive database that comprises the ontology's inference axioms and facts. A cost-based query optimization tec... | arxiv | @article{ruckhaus2007query,
title={Query Evaluation and Optimization in the Semantic Web},
author={Edna Ruckhaus, Eduardo Ruiz, Maria-Esther Vidal},
journal={arXiv preprint arXiv:0711.2087},
year={2007},
archivePrefix={arXiv},
eprint={0711.2087},
primaryClass={cs.DB cs.LO}
} | ruckhaus2007query |
arxiv-1795 | 0711.2102 | Patterns of iid Sequences and Their Entropy - Part II: Bounds for Some Distributions | <|reference_start|>Patterns of iid Sequences and Their Entropy - Part II: Bounds for Some Distributions: A pattern of a sequence is a sequence of integer indices with each index describing the order of first occurrence of the respective symbol in the original sequence. In a recent paper, tight general bounds on the blo... | arxiv | @article{shamir2007patterns,
title={Patterns of i.i.d. Sequences and Their Entropy - Part II: Bounds for
Some Distributions},
author={Gil I. Shamir},
journal={arXiv preprint arXiv:0711.2102},
year={2007},
archivePrefix={arXiv},
eprint={0711.2102},
primaryClass={cs.IT math.IT}
} | shamir2007patterns |
arxiv-1796 | 0711.2104 | On the Information Rates of the Plenoptic Function | <|reference_start|>On the Information Rates of the Plenoptic Function: The {\it plenoptic function} (Adelson and Bergen, 91) describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) are seen in video and in general visual content, and represent la... | arxiv | @article{cunha2007on,
title={On the Information Rates of the Plenoptic Function},
author={Arthur Cunha, Minh Do, and Martin Vetterli},
journal={arXiv preprint arXiv:0711.2104},
year={2007},
archivePrefix={arXiv},
eprint={0711.2104},
primaryClass={cs.IT cs.CV math.IT math.PR}
} | cunha2007on |
arxiv-1797 | 0711.2112 | Bi-capacities -- Part II: the Choquet integral | <|reference_start|>Bi-capacities -- Part II: the Choquet integral: Bi-capacities arise as a natural generalization of capacities (or fuzzy measures) in a context of decision making where underlying scales are bipolar. They are able to capture a wide variety of decision behaviours, encompassing models such as Cumulative... | arxiv | @article{grabisch2007bi-capacities,
title={Bi-capacities -- Part II: the Choquet integral},
author={Michel Grabisch (CES), Christophe Labreuche (TRT)},
journal={Fuzzy Sets and Systems (2005) 237-259},
year={2007},
archivePrefix={arXiv},
eprint={0711.2112},
primaryClass={cs.DM cs.GT}
} | grabisch2007bi-capacities |
arxiv-1798 | 0711.2114 | Bi-capacities -- Part I: definition, M\"obius transform and interaction | <|reference_start|>Bi-capacities -- Part I: definition, M\"obius transform and interaction: Bi-capacities arise as a natural generalization of capacities (or fuzzy measures) in a context of decision making where underlying scales are bipolar. They are able to capture a wide variety of decision behaviours, encompassing ... | arxiv | @article{grabisch2007bi-capacities,
title={Bi-capacities -- Part I: definition, M\"obius transform and interaction},
author={Michel Grabisch (CES), Christophe Labreuche (TRT)},
journal={Fuzzy Sets and Systems (2005) 211-236},
year={2007},
archivePrefix={arXiv},
eprint={0711.2114},
primaryCla... | grabisch2007bi-capacities |
arxiv-1799 | 0711.2115 | Derivative of functions over lattices as a basis for the notion of interaction between attributes | <|reference_start|>Derivative of functions over lattices as a basis for the notion of interaction between attributes: The paper proposes a general notion of interaction between attributes, which can be applied to many fields in decision making and data analysis. It generalizes the notion of interaction defined for crit... | arxiv | @article{grabisch2007derivative,
title={Derivative of functions over lattices as a basis for the notion of
interaction between attributes},
author={Michel Grabisch (CES), Christophe Labreuche (TRT)},
journal={Annals of Mathematics and Artificial Intelligence 49 (2007)
151-170},
year={2007},
arch... | grabisch2007derivative |
arxiv-1800 | 0711.2116 | A numerical approach for 3D manufacturing tolerances synthesis | <|reference_start|>A numerical approach for 3D manufacturing tolerances synthesis: Making a product conform to the functional requirements indicated by the customer suppose to be able to manage the manufacturing process chosen to realise the parts. A simulation step is generally performed to verify that the expected ge... | arxiv | @article{vignat2007a,
title={A numerical approach for 3D manufacturing tolerances synthesis},
author={Fr'ed'eric Vignat (LGS), Franc{c}ois Villeneuve (LGS)},
journal={Dans Proceedings of the 10th CIRP International Seminar on
Computer Aided Tolerancing - 10th CIRP International Seminar on Computer
Aided... | vignat2007a |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.