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-201 | 0705.0124 | On the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision Detection | <|reference_start|>On the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision Detection: The low-snr capacity of M-ary PSK transmission over both the additive white Gaussian noise (AWGN) and fading channels is analyzed when hard-decision detection is employed at the receiver. Closed-form expressions for the first... | arxiv | @article{gursoy2007on,
title={On the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision
Detection},
author={Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0705.0124},
year={2007},
doi={10.1109/ISIT.2007.4557221},
archivePrefix={arXiv},
eprint={0705.0124},
primaryClass={cs.I... | gursoy2007on |
arxiv-202 | 0705.0128 | Training Optimization for Gauss-Markov Rayleigh Fading Channels | <|reference_start|>Training Optimization for Gauss-Markov Rayleigh Fading Channels: In this paper, pilot-assisted transmission over Gauss-Markov Rayleigh fading channels is considered. A simple scenario, where a single pilot signal is transmitted every T symbols and T-1 data symbols are transmitted in between the pilot... | arxiv | @article{akin2007training,
title={Training Optimization for Gauss-Markov Rayleigh Fading Channels},
author={Sami Akin, Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0705.0128},
year={2007},
doi={10.1109/ICC.2007.994},
archivePrefix={arXiv},
eprint={0705.0128},
primaryClass={cs.IT m... | akin2007training |
arxiv-203 | 0705.0130 | Performance Analysis for Multichannel Reception of OOFSK Signaling | <|reference_start|>Performance Analysis for Multichannel Reception of OOFSK Signaling: In this paper, the error performance of on-off frequency shift keying (OOFSK) modulation over fading channels is analyzed when the receiver is equipped with multiple antennas. The analysis is conducted in two cases: the coherent scen... | arxiv | @article{wang2007performance,
title={Performance Analysis for Multichannel Reception of OOFSK Signaling},
author={Qingyun Wang, Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0705.0130},
year={2007},
doi={10.1109/WCNC.2007.444},
archivePrefix={arXiv},
eprint={0705.0130},
primaryClas... | wang2007performance |
arxiv-204 | 0705.0132 | Error Probability Analysis of Peaky Signaling over Fading Channels | <|reference_start|>Error Probability Analysis of Peaky Signaling over Fading Channels: In this paper, the performance of signaling strategies with high peak-to-average power ratio is analyzed in both coherent and noncoherent fading channels. Two recently proposed modulation schemes, namely on-off binary phase-shift key... | arxiv | @article{gursoy2007error,
title={Error Probability Analysis of Peaky Signaling over Fading Channels},
author={Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0705.0132},
year={2007},
archivePrefix={arXiv},
eprint={0705.0132},
primaryClass={cs.IT math.IT}
} | gursoy2007error |
arxiv-205 | 0705.0150 | Comparison of Discrete and Continuous Wavelet Transforms | <|reference_start|>Comparison of Discrete and Continuous Wavelet Transforms: In this paper we outline several points of view on the interplay between discrete and continuous wavelet transforms; stressing both pure and applied aspects of both. We outline some new links between the two transform technologies based on the... | arxiv | @article{jorgensen2007comparison,
title={Comparison of Discrete and Continuous Wavelet Transforms},
author={Palle E. T. Jorgensen, Myung-Sin Song},
journal={arXiv preprint arXiv:0705.0150},
year={2007},
archivePrefix={arXiv},
eprint={0705.0150},
primaryClass={cs.CE}
} | jorgensen2007comparison |
arxiv-206 | 0705.0178 | Oblivious Transfer based on Key Exchange | <|reference_start|>Oblivious Transfer based on Key Exchange: Key-exchange protocols have been overlooked as a possible means for implementing oblivious transfer (OT). In this paper we present a protocol for mutual exchange of secrets, 1-out-of-2 OT and coin flipping similar to Diffie-Hellman protocol using the idea of ... | arxiv | @article{parakh2007oblivious,
title={Oblivious Transfer based on Key Exchange},
author={Abhishek Parakh},
journal={Cryptologia, Volume 32, Issue 1 January 2008, pages 37 - 44},
year={2007},
doi={10.1080/01611190701593228},
archivePrefix={arXiv},
eprint={0705.0178},
primaryClass={cs.CR}
} | parakh2007oblivious |
arxiv-207 | 0705.0197 | Fault Classification in Cylinders Using Multilayer Perceptrons, Support Vector Machines and Guassian Mixture Models | <|reference_start|>Fault Classification in Cylinders Using Multilayer Perceptrons, Support Vector Machines and Guassian Mixture Models: Gaussian mixture models (GMM) and support vector machines (SVM) are introduced to classify faults in a population of cylindrical shells. The proposed procedures are tested on a populat... | arxiv | @article{marwala2007fault,
title={Fault Classification in Cylinders Using Multilayer Perceptrons, Support
Vector Machines and Guassian Mixture Models},
author={Tshilidzi Marwala, Unathi Mahola and Snehashish Chakraverty},
journal={Computer Assisted Mechanics and Engineering Sciences, Vol. 14, No.
2, 200... | marwala2007fault |
arxiv-208 | 0705.0199 | The Parameter-Less Self-Organizing Map algorithm | <|reference_start|>The Parameter-Less Self-Organizing Map algorithm: The Parameter-Less Self-Organizing Map (PLSOM) is a new neural network algorithm based on the Self-Organizing Map (SOM). It eliminates the need for a learning rate and annealing schemes for learning rate and neighbourhood size. We discuss the relative... | arxiv | @article{berglund2007the,
title={The Parameter-Less Self-Organizing Map algorithm},
author={Erik Berglund, Joaquin Sitte},
journal={IEEE Transactions on Neural Networks, 2006 v.17, n.2, pp.305-316},
year={2007},
archivePrefix={arXiv},
eprint={0705.0199},
primaryClass={cs.NE cs.AI cs.CV}
} | berglund2007the |
arxiv-209 | 0705.0204 | Using Images to create a Hierarchical Grid Spatial Index | <|reference_start|>Using Images to create a Hierarchical Grid Spatial Index: This paper presents a hybrid approach to spatial indexing of two dimensional data. It sheds new light on the age old problem by thinking of the traditional algorithms as working with images. Inspiration is drawn from an analogous situation tha... | arxiv | @article{machowski2007using,
title={Using Images to create a Hierarchical Grid Spatial Index},
author={Lukasz A. Machowski, and Tshilidzi Marwala},
journal={arXiv preprint arXiv:0705.0204},
year={2007},
doi={10.1109/ICSMC.2006.385020},
archivePrefix={arXiv},
eprint={0705.0204},
primaryCl... | machowski2007using |
arxiv-210 | 0705.0214 | Riemannian level-set methods for tensor-valued data | <|reference_start|>Riemannian level-set methods for tensor-valued data: We present a novel approach for the derivation of PDE modeling curvature-driven flows for matrix-valued data. This approach is based on the Riemannian geometry of the manifold of Symmetric Positive Definite Matrices Pos(n).<|reference_end|> | arxiv | @article{zerai2007riemannian,
title={Riemannian level-set methods for tensor-valued data},
author={Mourad Zerai, Maher Moakher},
journal={arXiv preprint arXiv:0705.0214},
year={2007},
archivePrefix={arXiv},
eprint={0705.0214},
primaryClass={cs.CV}
} | zerai2007riemannian |
arxiv-211 | 0705.0252 | Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels | <|reference_start|>Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels: We consider power allocation algorithms for fixed-rate transmission over Nakagami-m non-ergodic block-fading channels with perfect transmitter and receiver channel state information and discrete input signal constellations under b... | arxiv | @article{nguyen2007power,
title={Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels},
author={Khoa D. Nguyen, Albert Guillen i Fabregas and Lars K. Rasmussen},
journal={arXiv preprint arXiv:0705.0252},
year={2007},
archivePrefix={arXiv},
eprint={0705.0252},
primaryClass={c... | nguyen2007power |
arxiv-212 | 0705.0253 | More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding | <|reference_start|>More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding: There is a large literature devoted to the problem of finding an optimal (min-cost) prefix-free code with an unequal letter-cost encoding alphabet of size. While there is no known polynomial time algorithm for solving ... | arxiv | @article{golin2007more,
title={More Efficient Algorithms and Analyses for Unequal Letter Cost
Prefix-Free Coding},
author={Mordecai Golin and Li Jian},
journal={arXiv preprint arXiv:0705.0253},
year={2007},
archivePrefix={arXiv},
eprint={0705.0253},
primaryClass={cs.IT cs.DS math.IT}
} | golin2007more |
arxiv-213 | 0705.0262 | The Complexity of Games on Higher Order Pushdown Automata | <|reference_start|>The Complexity of Games on Higher Order Pushdown Automata: We prove an n-EXPTIME lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches the known upper bound for parity games on HPDA. As a consequence the mu-ca... | arxiv | @article{cachat2007the,
title={The Complexity of Games on Higher Order Pushdown Automata},
author={Thierry Cachat (LIAFA), Igor Walukiewicz (LaBRI)},
journal={arXiv preprint arXiv:0705.0262},
year={2007},
archivePrefix={arXiv},
eprint={0705.0262},
primaryClass={cs.GT}
} | cachat2007the |
arxiv-214 | 0705.0281 | Dynamic Clustering in Object-Oriented Databases: An Advocacy for Simplicity | <|reference_start|>Dynamic Clustering in Object-Oriented Databases: An Advocacy for Simplicity: We present in this paper three dynamic clustering techniques for Object-Oriented Databases (OODBs). The first two, Dynamic, Statistical & Tunable Clustering (DSTC) and StatClust, exploit both comprehensive usage statistics a... | arxiv | @article{darmont2007dynamic,
title={Dynamic Clustering in Object-Oriented Databases: An Advocacy for
Simplicity},
author={J'er^ome Darmont (LIMOS), Christophe Fromantin (LIMOS), St'ephane
R'egnier (LIMOS), Le Gruenwald, Michel Schneider (LIMOS)},
journal={LNCS, Vol. 1944 (06/2000) 71-85},
year={2007... | darmont2007dynamic |
arxiv-215 | 0705.0286 | Inverse-free Berlekamp-Massey-Sakata Algorithm and Small Decoders for Algebraic-Geometric Codes | <|reference_start|>Inverse-free Berlekamp-Massey-Sakata Algorithm and Small Decoders for Algebraic-Geometric Codes: This paper proposes a novel algorithm for finding error-locators of algebraic-geometric codes that can eliminate the division-calculations of finite fields from the Berlekamp-Massey-Sakata algorithm. This... | arxiv | @article{matsui2007inverse-free,
title={Inverse-free Berlekamp-Massey-Sakata Algorithm and Small Decoders for
Algebraic-Geometric Codes},
author={Hajime Matsui, Seiichi Mita},
journal={arXiv preprint arXiv:0705.0286},
year={2007},
archivePrefix={arXiv},
eprint={0705.0286},
primaryClass={cs... | matsui2007inverse-free |
arxiv-216 | 0705.0315 | WDM and Directed Star Arboricity | <|reference_start|>WDM and Directed Star Arboricity: A digraph is $m$-labelled if every arc is labelled by an integer in $\{1, \dots,m\}$. Motivated by wavelength assignment for multicasts in optical networks, we introduce and study $n$-fibre colourings of labelled digraphs. These are colourings of the arcs of $D$ such... | arxiv | @article{amini2007wdm,
title={WDM and Directed Star Arboricity},
author={Omid Amini, Frederic Havet, Florian Huc, Stephan Thomasse},
journal={Combinatorics, Probability and Computing, Volume 19, Issue 02,
March 2010, pp 161-182},
year={2007},
archivePrefix={arXiv},
eprint={0705.0315},
prim... | amini2007wdm |
arxiv-217 | 0705.0326 | Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid Random Walk and One-Dimensional Mobility Models | <|reference_start|>Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid Random Walk and One-Dimensional Mobility Models: Optimal delay-throughput trade-offs for two-dimensional i.i.d mobility models have been established in [23], where we showed that the optimal trade-offs can be achieved using rate-le... | arxiv | @article{ying2007optimal,
title={Optimal Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks: Hybrid
Random Walk and One-Dimensional Mobility Models},
author={Lei Ying and R. Srikant},
journal={arXiv preprint arXiv:0705.0326},
year={2007},
archivePrefix={arXiv},
eprint={0705.0326},
prima... | ying2007optimal |
arxiv-218 | 0705.0350 | Algorithms for laying points optimally on a plane and a circle | <|reference_start|>Algorithms for laying points optimally on a plane and a circle: Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.<|reference_end|> | arxiv | @article{sharipov2007algorithms,
title={Algorithms for laying points optimally on a plane and a circle},
author={Ruslan Sharipov},
journal={arXiv preprint arXiv:0705.0350},
year={2007},
archivePrefix={arXiv},
eprint={0705.0350},
primaryClass={cs.CG math.OC}
} | sharipov2007algorithms |
arxiv-219 | 0705.0413 | Edges and Switches, Tunnels and Bridges | <|reference_start|>Edges and Switches, Tunnels and Bridges: Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the lower edge in an appropriate neighborhood of the crossing. Certain orders will lead to a m... | arxiv | @article{eppstein2007edges,
title={Edges and Switches, Tunnels and Bridges},
author={David Eppstein, Marc van Kreveld, Elena Mumford, and Bettina Speckmann},
journal={Computational Geometry Theory & Applications 42(8): 790-802, 2009},
year={2007},
doi={10.1016/j.comgeo.2008.05.005},
archivePrefi... | eppstein2007edges |
arxiv-220 | 0705.0419 | Undirected Graphs of Entanglement Two | <|reference_start|>Undirected Graphs of Entanglement Two: Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the problem of deciding whether ... | arxiv | @article{belkhir2007undirected,
title={Undirected Graphs of Entanglement Two},
author={Walid Belkhir (LIF), Luigi Santocanale (LIF)},
journal={FSTTCS 2007: Foundations of Software Technology and Theoretical
Computer Science, Inde (2007)},
year={2007},
doi={10.1007/978-3-540-77050-3_42},
archiv... | belkhir2007undirected |
arxiv-221 | 0705.0422 | Frugal Colouring of Graphs | <|reference_start|>Frugal Colouring of Graphs: A $k$-frugal colouring of a graph $G$ is a proper colouring of the vertices of $G$ such that no colour appears more than $k$ times in the neighbourhood of a vertex. This type of colouring was introduced by Hind, Molloy and Reed in 1997. In this paper, we study the frugal c... | arxiv | @article{amini2007frugal,
title={Frugal Colouring of Graphs},
author={Omid Amini (INRIA Sophia Antipolis), Louis Esperet (LaBRI), Jan Van
Den Heuvel (LSE)},
journal={arXiv preprint arXiv:0705.0422},
year={2007},
archivePrefix={arXiv},
eprint={0705.0422},
primaryClass={cs.DM cs.NI}
} | amini2007frugal |
arxiv-222 | 0705.0423 | Encoding for the Blackwell Channel with Reinforced Belief Propagation | <|reference_start|>Encoding for the Blackwell Channel with Reinforced Belief Propagation: A key idea in coding for the broadcast channel (BC) is binning, in which the transmitter encode information by selecting a codeword from an appropriate bin (the messages are thus the bin indexes). This selection is normally done b... | arxiv | @article{braunstein2007encoding,
title={Encoding for the Blackwell Channel with Reinforced Belief Propagation},
author={A. Braunstein, F. Kayhan, G. Montorsi and R. Zecchina},
journal={IEEE International Symposium on Information Theory (ISIT07); 2007.
p. 1891-5},
year={2007},
doi={10.1109/ISIT.200... | braunstein2007encoding |
arxiv-223 | 0705.0425 | Batch Processor Sharing with Hyper-Exponential Service Time | <|reference_start|>Batch Processor Sharing with Hyper-Exponential Service Time: We study Batch Processor-Sharing (BPS) queuing model with hyper-exponential service time distribution and Poisson batch arrival process. One of the main goals to study BPS is the possibility of its application in size-based scheduling, whic... | arxiv | @article{osipova2007batch,
title={Batch Processor Sharing with Hyper-Exponential Service Time},
author={Natalia Osipova (INRIA Sophia Antipolis)},
journal={arXiv preprint arXiv:0705.0425},
year={2007},
archivePrefix={arXiv},
eprint={0705.0425},
primaryClass={cs.NI}
} | osipova2007batch |
arxiv-224 | 0705.0449 | Multiresolution Approximation of Polygonal Curves in Linear Complexity | <|reference_start|>Multiresolution Approximation of Polygonal Curves in Linear Complexity: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality between successive levels of resolution using dynami... | arxiv | @article{marteau2007multiresolution,
title={Multiresolution Approximation of Polygonal Curves in Linear Complexity},
author={Pierre-Franc{c}ois Marteau (VALORIA), Gilbas M'enier (VALORIA)},
journal={arXiv preprint arXiv:0705.0449},
year={2007},
archivePrefix={arXiv},
eprint={0705.0449},
prim... | marteau2007multiresolution |
arxiv-225 | 0705.0450 | VOODB: A Generic Discrete-Event Random Simulation Model to Evaluate the Performances of OODBs | <|reference_start|>VOODB: A Generic Discrete-Event Random Simulation Model to Evaluate the Performances of OODBs: Performance of object-oriented database systems (OODBs) is still an issue to both designers and users nowadays. The aim of this paper is to propose a generic discrete-event random simulation model, called V... | arxiv | @article{darmont2007voodb:,
title={VOODB: A Generic Discrete-Event Random Simulation Model to Evaluate the
Performances of OODBs},
author={J'er^ome Darmont (LIMOS), Michel Schneider (LIMOS)},
journal={25th International Conference on Very Large Databases (VLDB 99)
(09/1999) 254-265},
year={2007},
... | darmont2007voodb: |
arxiv-226 | 0705.0453 | OCB: A Generic Benchmark to Evaluate the Performances of Object-Oriented Database Systems | <|reference_start|>OCB: A Generic Benchmark to Evaluate the Performances of Object-Oriented Database Systems: We present in this paper a generic object-oriented benchmark (the Object Clustering Benchmark) that has been designed to evaluate the performances of clustering policies in object-oriented databases. OCB is gen... | arxiv | @article{darmont2007ocb:,
title={OCB: A Generic Benchmark to Evaluate the Performances of Object-Oriented
Database Systems},
author={J'er^ome Darmont (LIMOS), Bertrand Petit (LIMOS), Michel Schneider
(LIMOS)},
journal={LNCS, Vol. 1377 (03/1998) 326-340},
year={2007},
archivePrefix={arXiv},
e... | darmont2007ocb: |
arxiv-227 | 0705.0454 | Performance Evaluation for Clustering Algorithms in Object-Oriented Database Systems | <|reference_start|>Performance Evaluation for Clustering Algorithms in Object-Oriented Database Systems: It is widely acknowledged that good object clustering is critical to the performance of object-oriented databases. However, object clustering always involves some kind of overhead for the system. The aim of this pap... | arxiv | @article{darmont2007performance,
title={Performance Evaluation for Clustering Algorithms in Object-Oriented
Database Systems},
author={J'er^ome Darmont (LIMOS), Amar Attoui (LIMOS), Michel Gourgand
(LIMOS)},
journal={LNCS, Vol. 978 (09/1995) 187-196},
year={2007},
archivePrefix={arXiv},
epri... | darmont2007performance |
arxiv-228 | 0705.0462 | Resource modalities in game semantics | <|reference_start|>Resource modalities in game semantics: The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of a misleading conception: the belief that linear logic is more primitive than game semantics. We advocate instead the contrary: that game se... | arxiv | @article{melliès2007resource,
title={Resource modalities in game semantics},
author={Paul-Andr'e Melli`es (PPS), Nicolas Tabareau (PPS)},
journal={arXiv preprint arXiv:0705.0462},
year={2007},
archivePrefix={arXiv},
eprint={0705.0462},
primaryClass={math.CT cs.CL}
} | melliès2007resource |
arxiv-229 | 0705.0543 | The Design of Efficiently-Encodable Rate-Compatible LDPC Codes | <|reference_start|>The Design of Efficiently-Encodable Rate-Compatible LDPC Codes: We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturi... | arxiv | @article{kim2007the,
title={The Design of Efficiently-Encodable Rate-Compatible LDPC Codes},
author={Jaehong Kim, Aditya Ramamoorthy and Steven W. McLaughlin},
journal={arXiv preprint arXiv:0705.0543},
year={2007},
doi={10.1109/ICC.2006.254899},
archivePrefix={arXiv},
eprint={0705.0543},
... | kim2007the |
arxiv-230 | 0705.0552 | Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets | <|reference_start|>Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets: We consider the {\it indexable dictionary} problem, which consists of storing a set $S \subseteq \{0,...,m-1\}$ for some integer $m$, while supporting the operations of $\Rank(x)$, which returns th... | arxiv | @article{raman2007succinct,
title={Succinct Indexable Dictionaries with Applications to Encoding $k$-ary
Trees, Prefix Sums and Multisets},
author={Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti},
journal={ACM Transactions on Algorithms vol 3 (2007), Article 43, 25pp},
year={2007},
doi={10.114... | raman2007succinct |
arxiv-231 | 0705.0561 | Iterative Rounding for the Closest String Problem | <|reference_start|>Iterative Rounding for the Closest String Problem: The closest string problem is an NP-hard problem, whose task is to find a string that minimizes maximum Hamming distance to a given set of strings. This can be reduced to an integer program (IP). However, to date, there exists no known polynomial-tim... | arxiv | @article{chen2007iterative,
title={Iterative Rounding for the Closest String Problem},
author={Jing-Chao Chen},
journal={arXiv preprint arXiv:0705.0561},
year={2007},
archivePrefix={arXiv},
eprint={0705.0561},
primaryClass={cs.DS cs.CC}
} | chen2007iterative |
arxiv-232 | 0705.0564 | Rate Bounds for MIMO Relay Channels | <|reference_start|>Rate Bounds for MIMO Relay Channels: This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input single-output (SISO) relay channels, MIMO relay channels introduce additional degrees of freedom, making the desi... | arxiv | @article{lo2007rate,
title={Rate Bounds for MIMO Relay Channels},
author={Caleb K. Lo, Sriram Vishwanath and Robert W. Heath Jr},
journal={arXiv preprint arXiv:0705.0564},
year={2007},
archivePrefix={arXiv},
eprint={0705.0564},
primaryClass={cs.IT math.IT}
} | lo2007rate |
arxiv-233 | 0705.0588 | Clustering Co-occurrence of Maximal Frequent Patterns in Streams | <|reference_start|>Clustering Co-occurrence of Maximal Frequent Patterns in Streams: One way of getting a better view of data is using frequent patterns. In this paper frequent patterns are subsets that occur a minimal number of times in a stream of itemsets. However, the discovery of frequent patterns in streams has a... | arxiv | @article{de graaf2007clustering,
title={Clustering Co-occurrence of Maximal Frequent Patterns in Streams},
author={Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters},
journal={arXiv preprint arXiv:0705.0588},
year={2007},
archivePrefix={arXiv},
eprint={0705.0588},
primaryClass={cs.AI cs.DS}... | de graaf2007clustering |
arxiv-234 | 0705.0593 | Clustering with Lattices in the Analysis of Graph Patterns | <|reference_start|>Clustering with Lattices in the Analysis of Graph Patterns: Mining frequent subgraphs is an area of research where we have a given set of graphs (each graph can be seen as a transaction), and we search for (connected) subgraphs contained in many of these graphs. In this work we will discuss technique... | arxiv | @article{de graaf2007clustering,
title={Clustering with Lattices in the Analysis of Graph Patterns},
author={Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters},
journal={arXiv preprint arXiv:0705.0593},
year={2007},
archivePrefix={arXiv},
eprint={0705.0593},
primaryClass={cs.AI cs.DS}
} | de graaf2007clustering |
arxiv-235 | 0705.0599 | NodeTrix: Hybrid Representation for Analyzing Social Networks | <|reference_start|>NodeTrix: Hybrid Representation for Analyzing Social Networks: The need to visualize large social networks is growing as hardware capabilities make analyzing large networks feasible and many new data sets become available. Unfortunately, the visualizations in existing systems do not satisfactorily an... | arxiv | @article{henry2007nodetrix:,
title={NodeTrix: Hybrid Representation for Analyzing Social Networks},
author={Nathalie Henry, Jean-Daniel Fekete, Michael Mcguffin},
journal={arXiv preprint arXiv:0705.0599},
year={2007},
doi={10.1109/TVCG.2007.70582},
archivePrefix={arXiv},
eprint={0705.0599},
... | henry2007nodetrix: |
arxiv-236 | 0705.0602 | Risk Assessment Algorithms Based On Recursive Neural Networks | <|reference_start|>Risk Assessment Algorithms Based On Recursive Neural Networks: The assessment of highly-risky situations at road intersections have been recently revealed as an important research topic within the context of the automotive industry. In this paper we shall introduce a novel approach to compute risk fu... | arxiv | @article{de lara2007risk,
title={Risk Assessment Algorithms Based On Recursive Neural Networks},
author={Alejandro Chinea Manrique De Lara (INRIA Rocquencourt), Michel Parent
(INRIA Rocquencourt)},
journal={Dans International Joint Conference On Neural Networks - IJCNN
2007 (2007)},
year={2007},
... | de lara2007risk |
arxiv-237 | 0705.0612 | Privacy - an Issue for eLearning? A Trend Analysis Reflecting the Attitude of European eLearning Users | <|reference_start|>Privacy - an Issue for eLearning? A Trend Analysis Reflecting the Attitude of European eLearning Users: Availing services provided via the Internet became a widely accepted means in organising one's life. Beside others, eLearning goes with this trend as well. But, while employing Internet service mak... | arxiv | @article{borcea-pfitzmann2007privacy,
title={Privacy - an Issue for eLearning? A Trend Analysis Reflecting the
Attitude of European eLearning Users},
author={Katrin Borcea-Pfitzmann, Anne-Katrin Stange},
journal={arXiv preprint arXiv:0705.0612},
year={2007},
number={TUD-FI07-01},
archivePrefix... | borcea-pfitzmann2007privacy |
arxiv-238 | 0705.0635 | Moving Walkways, Escalators, and Elevators | <|reference_start|>Moving Walkways, Escalators, and Elevators: We study a simple geometric model of transportation facility that consists of two points between which the travel speed is high. This elementary definition can model shuttle services, tunnels, bridges, teleportation devices, escalators or moving walkways. T... | arxiv | @article{cardinal2007moving,
title={Moving Walkways, Escalators, and Elevators},
author={J. Cardinal, S. Collette, F. Hurtado, S. Langerman and B. Palop},
journal={arXiv preprint arXiv:0705.0635},
year={2007},
archivePrefix={arXiv},
eprint={0705.0635},
primaryClass={cs.CG}
} | cardinal2007moving |
arxiv-239 | 0705.0693 | Learning to Bluff | <|reference_start|>Learning to Bluff: The act of bluffing confounds game designers to this day. The very nature of bluffing is even open for debate, adding further complication to the process of creating intelligent virtual players that can bluff, and hence play, realistically. Through the use of intelligent, learning ... | arxiv | @article{hurwitz2007learning,
title={Learning to Bluff},
author={Evan Hurwitz and Tshilidzi Marwala},
journal={arXiv preprint arXiv:0705.0693},
year={2007},
archivePrefix={arXiv},
eprint={0705.0693},
primaryClass={cs.AI}
} | hurwitz2007learning |
arxiv-240 | 0705.0734 | Soft constraint abstraction based on semiring homomorphism | <|reference_start|>Soft constraint abstraction based on semiring homomorphism: The semiring-based constraint satisfaction problems (semiring CSPs), proposed by Bistarelli, Montanari and Rossi \cite{BMR97}, is a very general framework of soft constraints. In this paper we propose an abstraction scheme for soft constrain... | arxiv | @article{li2007soft,
title={Soft constraint abstraction based on semiring homomorphism},
author={Sanjiang Li and Mingsheng Ying},
journal={Theoretical Computer Science 403(2-3) 192-201, 2008},
year={2007},
doi={10.1016/j.tcs.2008.03.029},
archivePrefix={arXiv},
eprint={0705.0734},
primar... | li2007soft |
arxiv-241 | 0705.0738 | The Optimization of a Novel Prismatic Drive | <|reference_start|>The Optimization of a Novel Prismatic Drive: The design of a mechanical transmission taking into account the transmitted forces is reported in this paper. This transmission is based on Slide-o-Cam, a cam mechanism with multiple rollers mounted on a common translating follower. The design of Slide-o-C... | arxiv | @article{chablat2007the,
title={The Optimization of a Novel Prismatic Drive},
author={Damien Chablat (IRCCyN), St'ephane Caro (IRCCyN), Emilie Bouyer
(IRCCyN)},
journal={arXiv preprint arXiv:0705.0738},
year={2007},
archivePrefix={arXiv},
eprint={0705.0738},
primaryClass={cs.RO}
} | chablat2007the |
arxiv-242 | 0705.0742 | MIMO detection employing Markov Chain Monte Carlo | <|reference_start|>MIMO detection employing Markov Chain Monte Carlo: We propose a soft-output detection scheme for Multiple-Input-Multiple-Output (MIMO) systems. The detector employs Markov Chain Monte Carlo method to compute bit reliabilities from the signals received and is thus suited for coded MIMO systems. It off... | arxiv | @article{sundaram2007mimo,
title={MIMO detection employing Markov Chain Monte Carlo},
author={V.Sundaram and K.P.N.Murthy},
journal={arXiv preprint arXiv:0705.0742},
year={2007},
archivePrefix={arXiv},
eprint={0705.0742},
primaryClass={cs.GL}
} | sundaram2007mimo |
arxiv-243 | 0705.0751 | Approximate textual retrieval | <|reference_start|>Approximate textual retrieval: An approximate textual retrieval algorithm for searching sources with high levels of defects is presented. It considers splitting the words in a query into two overlapping segments and subsequently building composite regular expressions from interlacing subsets of the s... | arxiv | @article{constans2007approximate,
title={Approximate textual retrieval},
author={Pere Constans},
journal={arXiv preprint arXiv:0705.0751},
year={2007},
archivePrefix={arXiv},
eprint={0705.0751},
primaryClass={cs.IR cs.DL}
} | constans2007approximate |
arxiv-244 | 0705.0760 | Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs | <|reference_start|>Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs: Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide variety of applications, there are relati... | arxiv | @article{sanghavi2007equivalence,
title={Equivalence of LP Relaxation and Max-Product for Weighted Matching in
General Graphs},
author={Sujay Sanghavi},
journal={arXiv preprint arXiv:0705.0760},
year={2007},
archivePrefix={arXiv},
eprint={0705.0760},
primaryClass={cs.IT cs.AI cs.LG cs.NI m... | sanghavi2007equivalence |
arxiv-245 | 0705.0761 | Bayesian Approach to Neuro-Rough Models | <|reference_start|>Bayesian Approach to Neuro-Rough Models: This paper proposes a neuro-rough model based on multi-layered perceptron and rough set. The neuro-rough model is then tested on modelling the risk of HIV from demographic data. The model is formulated using Bayesian framework and trained using Monte Carlo met... | arxiv | @article{marwala2007bayesian,
title={Bayesian Approach to Neuro-Rough Models},
author={Tshilidzi Marwala and Bodie Crossingham},
journal={arXiv preprint arXiv:0705.0761},
year={2007},
archivePrefix={arXiv},
eprint={0705.0761},
primaryClass={cs.AI}
} | marwala2007bayesian |
arxiv-246 | 0705.0781 | Medical Image Segmentation and Localization using Deformable Templates | <|reference_start|>Medical Image Segmentation and Localization using Deformable Templates: This paper presents deformable templates as a tool for segmentation and localization of biological structures in medical images. Structures are represented by a prototype template, combined with a parametric warp mapping used to ... | arxiv | @article{spiller2007medical,
title={Medical Image Segmentation and Localization using Deformable Templates},
author={Jonathan M.Spiller and T. Marwala},
journal={arXiv preprint arXiv:0705.0781},
year={2007},
archivePrefix={arXiv},
eprint={0705.0781},
primaryClass={cs.CV}
} | spiller2007medical |
arxiv-247 | 0705.0783 | Non-cooperative games for spreading code optimization, power control and receiver design in wireless data networks | <|reference_start|>Non-cooperative games for spreading code optimization, power control and receiver design in wireless data networks: This paper focuses on the issue of energy efficiency in wireless data networks through a game theoretic approach. The case considered is that in which each user is allowed to vary its t... | arxiv | @article{buzzi2007non-cooperative,
title={Non-cooperative games for spreading code optimization, power control and
receiver design in wireless data networks},
author={Stefano Buzzi, and H. Vincent Poor},
journal={arXiv preprint arXiv:0705.0783},
year={2007},
archivePrefix={arXiv},
eprint={0705... | buzzi2007non-cooperative |
arxiv-248 | 0705.0815 | Overview of the Netsukuku network | <|reference_start|>Overview of the Netsukuku network: Netsukuku is a P2P network system designed to handle a large number of nodes with minimal CPU and memory resources. It can be easily used to build a worldwide distributed, anonymous and not controlled network, separated from the Internet, without the support of any ... | arxiv | @article{pumo2007overview,
title={Overview of the Netsukuku network},
author={Andrea Lo Pumo},
journal={arXiv preprint arXiv:0705.0815},
year={2007},
archivePrefix={arXiv},
eprint={0705.0815},
primaryClass={cs.NI}
} | pumo2007overview |
arxiv-249 | 0705.0817 | Quantum Shortest Path Netsukuku | <|reference_start|>Quantum Shortest Path Netsukuku: This document describes the QSPN, the routing discovery algorithm used by Netsukuku. Through a deductive analysis the main proprieties of the QSPN are shown. Moreover, a second version of the algorithm, is presented.<|reference_end|> | arxiv | @article{pumo2007quantum,
title={Quantum Shortest Path Netsukuku},
author={Andrea Lo Pumo},
journal={arXiv preprint arXiv:0705.0817},
year={2007},
archivePrefix={arXiv},
eprint={0705.0817},
primaryClass={cs.NI}
} | pumo2007quantum |
arxiv-250 | 0705.0819 | The Netsukuku network topology | <|reference_start|>The Netsukuku network topology: In this document, we describe the fractal structure of the Netsukuku topology. Moreover, we show how it is possible to use the QSPN v2 on the high levels of the fractal.<|reference_end|> | arxiv | @article{pumo2007the,
title={The Netsukuku network topology},
author={Andrea Lo Pumo},
journal={arXiv preprint arXiv:0705.0819},
year={2007},
archivePrefix={arXiv},
eprint={0705.0819},
primaryClass={cs.NI}
} | pumo2007the |
arxiv-251 | 0705.0820 | ANDNA: the distributed hostname management system of Netsukuku | <|reference_start|>ANDNA: the distributed hostname management system of Netsukuku: We present the Abnormal Netsukuku Domain Name Anarchy system. ANDNA is the distributed, non hierarchical and decentralised system of hostname management used in the Netsukuku network.<|reference_end|> | arxiv | @article{pumo2007andna:,
title={ANDNA: the distributed hostname management system of Netsukuku},
author={Andrea Lo Pumo},
journal={arXiv preprint arXiv:0705.0820},
year={2007},
archivePrefix={arXiv},
eprint={0705.0820},
primaryClass={cs.NI}
} | pumo2007andna: |
arxiv-252 | 0705.0828 | Enhancement of Noisy Planar Nuclear Medicine Images using Mean Field Annealing | <|reference_start|>Enhancement of Noisy Planar Nuclear Medicine Images using Mean Field Annealing: Nuclear medicine (NM) images inherently suffer from large amounts of noise and blur. The purpose of this research is to reduce the noise and blur while maintaining image integrity for improved diagnosis. The proposed solu... | arxiv | @article{falk2007enhancement,
title={Enhancement of Noisy Planar Nuclear Medicine Images using Mean Field
Annealing},
author={D.L. Falk, D. M. Rubin and T. Marwala},
journal={arXiv preprint arXiv:0705.0828},
year={2007},
archivePrefix={arXiv},
eprint={0705.0828},
primaryClass={cs.CV}
} | falk2007enhancement |
arxiv-253 | 0705.0856 | The Multiobjective Optimization of a Prismatic Drive | <|reference_start|>The Multiobjective Optimization of a Prismatic Drive: The multiobjective optimization of Slide-o-Cam is reported in this paper. Slide-o-Cam is a cam mechanism with multiple rollers mounted on a common translating follower. This transmission provides pure-rolling motion, thereby reducing the friction ... | arxiv | @article{bouyer2007the,
title={The Multiobjective Optimization of a Prismatic Drive},
author={Emilie Bouyer (IRCCyN), St'ephane Caro (IRCCyN), Damien Chablat
(IRCCyN), Jorge Angeles (CIM)},
journal={ASME Design Engineering Technical Conference (04/09/2007) 1-9},
year={2007},
archivePrefix={arXiv},... | bouyer2007the |
arxiv-254 | 0705.0895 | Epsilon-Distortion Complexity for Cantor Sets | <|reference_start|>Epsilon-Distortion Complexity for Cantor Sets: We define the epsilon-distortion complexity of a set as the shortest program, running on a universal Turing machine, which produces this set at the precision epsilon in the sense of Hausdorff distance. Then, we estimate the epsilon-distortion complexity ... | arxiv | @article{bonanno2007epsilon-distortion,
title={Epsilon-Distortion Complexity for Cantor Sets},
author={C. Bonanno, J.-R. Chazottes, P. Collet},
journal={arXiv preprint arXiv:0705.0895},
year={2007},
archivePrefix={arXiv},
eprint={0705.0895},
primaryClass={math.DS cs.CC math.MG}
} | bonanno2007epsilon-distortion |
arxiv-255 | 0705.0909 | Game-Theoretic Power Control in Impulse Radio UWB Wireless Networks | <|reference_start|>Game-Theoretic Power Control in Impulse Radio UWB Wireless Networks: In this paper, a game-theoretic model for studying power control for wireless data networks in frequency-selective multipath environments is analyzed. The uplink of an impulse-radio ultrawideband system is considered. The effects of... | arxiv | @article{bacci2007game-theoretic,
title={Game-Theoretic Power Control in Impulse Radio UWB Wireless Networks},
author={Giacomo Bacci, Marco Luise, H. Vincent Poor},
journal={arXiv preprint arXiv:0705.0909},
year={2007},
archivePrefix={arXiv},
eprint={0705.0909},
primaryClass={cs.GT cs.IT mat... | bacci2007game-theoretic |
arxiv-256 | 0705.0915 | Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem | <|reference_start|>Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem: Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem is NP-complete. They also showed that for infinite rotation puzzles, this problem becomes undeci... | arxiv | @article{baumeister2007satisfiability,
title={Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle
Problem},
author={Dorothea Baumeister and Joerg Rothe},
journal={arXiv preprint arXiv:0705.0915},
year={2007},
archivePrefix={arXiv},
eprint={0705.0915},
primaryClass={cs.... | baumeister2007satisfiability |
arxiv-257 | 0705.0932 | Variable-Rate Distributed Source Coding in the Presence of Byzantine Sensors | <|reference_start|>Variable-Rate Distributed Source Coding in the Presence of Byzantine Sensors: The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown number of sensors have been reprogrammed by a malicious intruder to undermine the reconstruc... | arxiv | @article{kosut2007variable-rate,
title={Variable-Rate Distributed Source Coding in the Presence of Byzantine
Sensors},
author={Oliver Kosut and Lang Tong},
journal={arXiv preprint arXiv:0705.0932},
year={2007},
archivePrefix={arXiv},
eprint={0705.0932},
primaryClass={cs.IT math.IT}
} | kosut2007variable-rate |
arxiv-258 | 0705.0933 | Computing Minimal Polynomials of Matrices | <|reference_start|>Computing Minimal Polynomials of Matrices: We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical implementation. The alg... | arxiv | @article{neunhoeffer2007computing,
title={Computing Minimal Polynomials of Matrices},
author={Max Neunhoeffer, Cheryl E. Praeger},
journal={arXiv preprint arXiv:0705.0933},
year={2007},
archivePrefix={arXiv},
eprint={0705.0933},
primaryClass={math.RA cs.DS}
} | neunhoeffer2007computing |
arxiv-259 | 0705.0936 | Performance Comparison of Energy-Efficient Power Control for CDMA and Multiuser UWB Networks | <|reference_start|>Performance Comparison of Energy-Efficient Power Control for CDMA and Multiuser UWB Networks: This paper studies the performance of a wireless data network using energy-efficient power control techniques when different multiple access schemes, namely direct-sequence code division multiple access (DS-... | arxiv | @article{bacci2007performance,
title={Performance Comparison of Energy-Efficient Power Control for CDMA and
Multiuser UWB Networks},
author={Giacomo Bacci, Marco Luise, H. Vincent Poor},
journal={arXiv preprint arXiv:0705.0936},
year={2007},
archivePrefix={arXiv},
eprint={0705.0936},
prima... | bacci2007performance |
arxiv-260 | 0705.0952 | An Independent Evaluation of Subspace Face Recognition Algorithms | <|reference_start|>An Independent Evaluation of Subspace Face Recognition Algorithms: This paper explores a comparative study of both the linear and kernel implementations of three of the most popular Appearance-based Face Recognition projection classes, these being the methodologies of Principal Component Analysis, Li... | arxiv | @article{surajpal2007an,
title={An Independent Evaluation of Subspace Face Recognition Algorithms},
author={Dhiresh R. Surajpal and Tshilidzi Marwala},
journal={arXiv preprint arXiv:0705.0952},
year={2007},
archivePrefix={arXiv},
eprint={0705.0952},
primaryClass={cs.CV}
} | surajpal2007an |
arxiv-261 | 0705.0956 | On Isotropic Sets of Points in the Plane Application to the Design of Robot Archirectures | <|reference_start|>On Isotropic Sets of Points in the Plane Application to the Design of Robot Archirectures: Various performance indices are used for the design of serial manipulators. One method of optimization relies on the condition number of the Jacobian matrix. The minimization of the condition number leads, unde... | arxiv | @article{angeles2007on,
title={On Isotropic Sets of Points in the Plane. Application to the Design of
Robot Archirectures},
author={Jorge Angeles (CIM), Damien Chablat (IRCCyN)},
journal={7th International Symposium on Advances in Robot Kinematics (2000)
1-10},
year={2007},
archivePrefix={arXiv}... | angeles2007on |
arxiv-262 | 0705.0959 | The Kinematic Analysis of a Symmetrical Three-Degree-of-Freedom Planar Parallel Manipulator | <|reference_start|>The Kinematic Analysis of a Symmetrical Three-Degree-of-Freedom Planar Parallel Manipulator: Presented in this paper is the kinematic analysis of a symmetrical three-degree-of-freedom planar parallel manipulator. In opposite to serial manipulators, parallel manipulators can admit not only multiple in... | arxiv | @article{chablat2007the,
title={The Kinematic Analysis of a Symmetrical Three-Degree-of-Freedom Planar
Parallel Manipulator},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={Symposium on Robot Design, Dynamics and Control (2004) 1-7},
year={2007},
archivePrefix={arXiv},
ep... | chablat2007the |
arxiv-263 | 0705.0960 | Uniqueness Domains in the Workspace of Parallel Manipulators | <|reference_start|>Uniqueness Domains in the Workspace of Parallel Manipulators: This work investigates new kinematic features of parallel manipulators. It is well known that parallel manipulators admit generally several direct kinematic solutions for a given set of input joint values. The aim of this paper is to chara... | arxiv | @article{wenger2007uniqueness,
title={Uniqueness Domains in the Workspace of Parallel Manipulators},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Syroco' 97 (1997) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0705.0960},
primaryClass={cs.RO}
} | wenger2007uniqueness |
arxiv-264 | 0705.0961 | The Kinematic design of a 3-dof Hybrid Manipulator | <|reference_start|>The Kinematic design of a 3-dof Hybrid Manipulator: This paper focuses on the kinematic properties of a new three-degree-of-freedom hybrid manipulator. This manipulator is obtained by adding in series to a five-bar planar mechanism (similar to the one studied by Bajpai and Roth) a third revolute pass... | arxiv | @article{chablat2007the,
title={The Kinematic design of a 3-dof Hybrid Manipulator},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Jorge Angeles (CIM)},
journal={2nd International Conference On Integrated Design and
Manufacturing in Mechanical Engineering (1998) 1-8},
year={2007},
arc... | chablat2007the |
arxiv-265 | 0705.0962 | Definition sets for the Direct Kinematics of Parallel Manipulators | <|reference_start|>Definition sets for the Direct Kinematics of Parallel Manipulators: The aim of this paper is to characterize the uniqueness domains in the workspace of parallel manipulators, as well as their image in the joint space. The notion of aspect introduced for serial manipulators in [Borrel 86] is redefined... | arxiv | @article{wenger2007definition,
title={Definition sets for the Direct Kinematics of Parallel Manipulators},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={8th International Conference in Advanced Robotics (1997) 1-6},
year={2007},
archivePrefix={arXiv},
eprint={0705.0962},
... | wenger2007definition |
arxiv-266 | 0705.0965 | Improved Analysis of Kannan's Shortest Lattice Vector Algorithm | <|reference_start|>Improved Analysis of Kannan's Shortest Lattice Vector Algorithm: The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest non-zero lattice vector and a closest lattice vector to a given target vector in high dimen... | arxiv | @article{hanrot2007improved,
title={Improved Analysis of Kannan's Shortest Lattice Vector Algorithm},
author={Guillaume Hanrot (INRIA Lorraine - LORIA), Damien Stehl'e (INRIA
Rh^one-Alpes)},
journal={Dans Advances in Cryptology - Crypto'07 4622 (2007) 170-186},
year={2007},
doi={10.1007/978-3-540-... | hanrot2007improved |
arxiv-267 | 0705.0969 | Artificial Neural Networks and Support Vector Machines for Water Demand Time Series Forecasting | <|reference_start|>Artificial Neural Networks and Support Vector Machines for Water Demand Time Series Forecasting: Water plays a pivotal role in many physical processes, and most importantly in sustaining human life, animal life and plant life. Water supply entities therefore have the responsibility to supply clean an... | arxiv | @article{msiza2007artificial,
title={Artificial Neural Networks and Support Vector Machines for Water Demand
Time Series Forecasting},
author={Ishmael S. Msiza, Fulufhelo V. Nelwamondo and Tshilidzi Marwala},
journal={arXiv preprint arXiv:0705.0969},
year={2007},
archivePrefix={arXiv},
eprint=... | msiza2007artificial |
arxiv-268 | 0705.0982 | A New Three-DOF Parallel Mechanism: Milling Machine Applications | <|reference_start|>A New Three-DOF Parallel Mechanism: Milling Machine Applications: This paper describes a new parallel kinematic architecture for machining applications, namely, the orthoglide. This machine features three fixed parallel linear joints which are mounted orthogonally and a mobile platform which moves in... | arxiv | @article{chablat2007a,
title={A New Three-DOF Parallel Mechanism: Milling Machine Applications},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={The 2nd Chemnitz Parallel Kinematics Seminar (2000) 1-9},
year={2007},
archivePrefix={arXiv},
eprint={0705.0982},
primaryClass... | chablat2007a |
arxiv-269 | 0705.0999 | Cellular Systems with Full-Duplex Amplify-and-Forward Relaying and Cooperative Base-Stations | <|reference_start|>Cellular Systems with Full-Duplex Amplify-and-Forward Relaying and Cooperative Base-Stations: In this paper the benefits provided by multi-cell processing of signals transmitted by mobile terminals which are received via dedicated relay terminals (RTs) are assessed. Unlike previous works, each RT is ... | arxiv | @article{somekh2007cellular,
title={Cellular Systems with Full-Duplex Amplify-and-Forward Relaying and
Cooperative Base-Stations},
author={Oren Somekh, Osvaldo Simeone, H. Vincent Poor, and Shlomo Shamai
(Shitz)},
journal={arXiv preprint arXiv:0705.0999},
year={2007},
doi={10.1109/ISIT.2007.4557... | somekh2007cellular |
arxiv-270 | 0705.1013 | Tracking User Attention in Collaborative Tagging Communities | <|reference_start|>Tracking User Attention in Collaborative Tagging Communities: Collaborative tagging has recently attracted the attention of both industry and academia due to the popularity of content-sharing systems such as CiteULike, del.icio.us, and Flickr. These systems give users the opportunity to add data item... | arxiv | @article{santos-neto2007tracking,
title={Tracking User Attention in Collaborative Tagging Communities},
author={Elizeu Santos-Neto, Matei Ripeanu and Adriana Iamnitchi},
journal={arXiv preprint arXiv:0705.1013},
year={2007},
archivePrefix={arXiv},
eprint={0705.1013},
primaryClass={cs.DL cs.C... | santos-neto2007tracking |
arxiv-271 | 0705.1025 | Recognizing Partial Cubes in Quadratic Time | <|reference_start|>Recognizing Partial Cubes in Quadratic Time: We show how to test whether a graph with n vertices and m edges is a partial cube, and if so how to find a distance-preserving embedding of the graph into a hypercube, in the near-optimal time bound O(n^2), improving previous O(nm)-time solutions.<|referen... | arxiv | @article{eppstein2007recognizing,
title={Recognizing Partial Cubes in Quadratic Time},
author={David Eppstein},
journal={Journal of Graph Algorithms and Applications 15(2) 269-293, 2011},
year={2007},
archivePrefix={arXiv},
eprint={0705.1025},
primaryClass={cs.DS}
} | eppstein2007recognizing |
arxiv-272 | 0705.1031 | Fuzzy Artmap and Neural Network Approach to Online Processing of Inputs with Missing Values | <|reference_start|>Fuzzy Artmap and Neural Network Approach to Online Processing of Inputs with Missing Values: An ensemble based approach for dealing with missing data, without predicting or imputing the missing values is proposed. This technique is suitable for online operations of neural networks and as a result, is... | arxiv | @article{nelwamondo2007fuzzy,
title={Fuzzy Artmap and Neural Network Approach to Online Processing of Inputs
with Missing Values},
author={F.V. Nelwamondo and T. Marwala},
journal={arXiv preprint arXiv:0705.1031},
year={2007},
archivePrefix={arXiv},
eprint={0705.1031},
primaryClass={cs.AI}... | nelwamondo2007fuzzy |
arxiv-273 | 0705.1033 | Optimal Cache-Oblivious Mesh Layouts | <|reference_start|>Optimal Cache-Oblivious Mesh Layouts: A mesh is a graph that divides physical space into regularly-shaped regions. Meshes computations form the basis of many applications, e.g. finite-element methods, image rendering, and collision detection. In one important mesh primitive, called a mesh update, eac... | arxiv | @article{bender2007optimal,
title={Optimal Cache-Oblivious Mesh Layouts},
author={Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang},
journal={arXiv preprint arXiv:0705.1033},
year={2007},
archivePrefix={arXiv},
eprint={0705.1033},
primaryClass={cs.DS cs.CE cs.MS cs.NA}
} | bender2007optimal |
arxiv-274 | 0705.1036 | Strategies for the Design of a Slide-o-Cam Transmission | <|reference_start|>Strategies for the Design of a Slide-o-Cam Transmission: The optimization of the pressure angle in a cam-follower transmission is reported in this paper. This transmission is based on Slide-o-Cam, a cam mechanism with multiple rollers mounted on a common translating follower. The design of Slide-o-Ca... | arxiv | @article{chablat2007strategies,
title={Strategies for the Design of a Slide-o-Cam Transmission},
author={Damien Chablat (IRCCyN), Jorge Angeles (CIM)},
journal={Proceedings of CK2005, International Workshop on Computational
Kinematics (10/05/2005) 1-10},
year={2007},
archivePrefix={arXiv},
epr... | chablat2007strategies |
arxiv-275 | 0705.1037 | Regions of Feasible Point-to-Point Trajectories in the Cartesian Workspace of Fully-Parallel Manipulators | <|reference_start|>Regions of Feasible Point-to-Point Trajectories in the Cartesian Workspace of Fully-Parallel Manipulators: The goal of this paper is to define the n-connected regions in the Cartesian workspace of fully-parallel manipulators, i.e. the maximal regions where it is possible to execute point-to-point mot... | arxiv | @article{chablat2007regions,
title={Regions of Feasible Point-to-Point Trajectories in the Cartesian
Workspace of Fully-Parallel Manipulators},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={25th Design Automation Conference (1999) 1-6},
year={2007},
archivePrefix={arXiv},
... | chablat2007regions |
arxiv-276 | 0705.1038 | The Design of Parallel Kinematic Machine Tools Using Kinetostatic Performance Criteria | <|reference_start|>The Design of Parallel Kinematic Machine Tools Using Kinetostatic Performance Criteria: Most industrial machine tools have a serial kinematic architecture, which means that each axis has to carry the following one, including its actuators and joints. High Speed Machining highlights some drawbacks of ... | arxiv | @article{majou2007the,
title={The Design of Parallel Kinematic Machine Tools Using Kinetostatic
Performance Criteria},
author={F'elix Majou (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
(IRCCyN)},
journal={3d Int. Conference on Metal Cutting (2001) 1-10},
year={2007},
archivePrefix={arXiv},... | majou2007the |
arxiv-277 | 0705.1110 | Mining Patterns with a Balanced Interval | <|reference_start|>Mining Patterns with a Balanced Interval: In many applications it will be useful to know those patterns that occur with a balanced interval, e.g., a certain combination of phone numbers are called almost every Friday or a group of products are sold a lot on Tuesday and Thursday. In previous work we... | arxiv | @article{kosters2007mining,
title={Mining Patterns with a Balanced Interval},
author={Edgar de Graaf Joost Kok Walter Kosters},
journal={arXiv preprint arXiv:0705.1110},
year={2007},
archivePrefix={arXiv},
eprint={0705.1110},
primaryClass={cs.AI cs.DB}
} | kosters2007mining |
arxiv-278 | 0705.1148 | S\'eparation des Solutions aux Mod\`eles G\'eom\'etriques Direct et Inverse pour les Manipulateurs Pleinement Parall\`eles | <|reference_start|>S\'eparation des Solutions aux Mod\`eles G\'eom\'etriques Direct et Inverse pour les Manipulateurs Pleinement Parall\`eles: This article provides a formalism making it possible to manage the solutions of the direct and inverse kinematic models of the fully parallel manipulators. We introduce the conc... | arxiv | @article{chablat2007s\'eparation,
title={S\'eparation des Solutions aux Mod\`eles G\'eom\'etriques Direct et
Inverse pour les Manipulateurs Pleinement Parall\`eles},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={Journal of Mechanism and Machine Theory 36, 6 (2001) 763-783},
year... | chablat2007s\'eparation |
arxiv-279 | 0705.1150 | On the Kinetostatic Optimization of Revolute-Coupled Planar Manipulators | <|reference_start|>On the Kinetostatic Optimization of Revolute-Coupled Planar Manipulators: Proposed in this paper is a kinetostatic performance index for the optimum dimensioning of planar manipulators of the serial type. The index is based on the concept of distance of the underlying Jacobian matrix to a given isotr... | arxiv | @article{chablat2007on,
title={On the Kinetostatic Optimization of Revolute-Coupled Planar Manipulators},
author={Damien Chablat (IRCCyN), Jorge Angeles (CIM)},
journal={Journal of Mechanism and Machine Theory (2002) 351-374},
year={2007},
archivePrefix={arXiv},
eprint={0705.1150},
primaryCl... | chablat2007on |
arxiv-280 | 0705.1151 | Achievable Rates and Optimal Resource Allocation for Imperfectly-Known Fading Relay Channels | <|reference_start|>Achievable Rates and Optimal Resource Allocation for Imperfectly-Known Fading Relay Channels: In this paper, achievable rates of imperfectly-known fading relay channels are studied. It is assumed that communication starts with the network training phase in which the receivers estimate the fading coef... | arxiv | @article{zhang2007achievable,
title={Achievable Rates and Optimal Resource Allocation for Imperfectly-Known
Fading Relay Channels},
author={Junwei Zhang, Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0705.1151},
year={2007},
archivePrefix={arXiv},
eprint={0705.1151},
primaryClass={cs... | zhang2007achievable |
arxiv-281 | 0705.1159 | Ordering Finite-State Markov Channels by Mutual Information | <|reference_start|>Ordering Finite-State Markov Channels by Mutual Information: In previous work, an ordering result was given for the symbolwise probability of error using general Markov channels, under iterative decoding of LDPC codes. In this paper, the ordering result is extended to mutual information, under the as... | arxiv | @article{eckford2007ordering,
title={Ordering Finite-State Markov Channels by Mutual Information},
author={Andrew W. Eckford},
journal={arXiv preprint arXiv:0705.1159},
year={2007},
archivePrefix={arXiv},
eprint={0705.1159},
primaryClass={cs.IT math.IT}
} | eckford2007ordering |
arxiv-282 | 0705.1161 | IDF revisited: A simple new derivation within the Robertson-Sp\"arck Jones probabilistic model | <|reference_start|>IDF revisited: A simple new derivation within the Robertson-Sp\"arck Jones probabilistic model: There have been a number of prior attempts to theoretically justify the effectiveness of the inverse document frequency (IDF). Those that take as their starting point Robertson and Sparck Jones's probabili... | arxiv | @article{lee2007idf,
title={IDF revisited: A simple new derivation within the Robertson-Sp\"arck
Jones probabilistic model},
author={Lillian Lee},
journal={arXiv preprint arXiv:0705.1161},
year={2007},
archivePrefix={arXiv},
eprint={0705.1161},
primaryClass={cs.IR cs.CL}
} | lee2007idf |
arxiv-283 | 0705.1183 | Multiple Antenna Secure Broadcast over Wireless Networks | <|reference_start|>Multiple Antenna Secure Broadcast over Wireless Networks: In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the probl... | arxiv | @article{liu2007multiple,
title={Multiple Antenna Secure Broadcast over Wireless Networks},
author={Ruoheng Liu and H. Vincent Poor},
journal={arXiv preprint arXiv:0705.1183},
year={2007},
archivePrefix={arXiv},
eprint={0705.1183},
primaryClass={cs.IT math.IT}
} | liu2007multiple |
arxiv-284 | 0705.1187 | Symbol Error Rates of Maximum-Likelihood Detector: Convex/Concave Behavior and Applications | <|reference_start|>Symbol Error Rates of Maximum-Likelihood Detector: Convex/Concave Behavior and Applications: Convexity/concavity properties of symbol error rates (SER) of the maximum likelihood detector operating in the AWGN channel (non-fading and fading) are studied. Generic conditions are identified under which t... | arxiv | @article{loyka2007symbol,
title={Symbol Error Rates of Maximum-Likelihood Detector: Convex/Concave
Behavior and Applications},
author={Sergey Loyka, Victoria Kostina, Francois Gagnon},
journal={arXiv preprint arXiv:0705.1187},
year={2007},
doi={10.1109/ISIT.2007.4557176},
archivePrefix={arXiv}... | loyka2007symbol |
arxiv-285 | 0705.1209 | Artificial Intelligence for Conflict Management | <|reference_start|>Artificial Intelligence for Conflict Management: Militarised conflict is one of the risks that have a significant impact on society. Militarised Interstate Dispute (MID) is defined as an outcome of interstate interactions, which result on either peace or conflict. Effective prediction of the possibil... | arxiv | @article{habtemariam2007artificial,
title={Artificial Intelligence for Conflict Management},
author={E. Habtemariam, T. Marwala and M. Lagazio},
journal={arXiv preprint arXiv:0705.1209},
year={2007},
archivePrefix={arXiv},
eprint={0705.1209},
primaryClass={cs.AI}
} | habtemariam2007artificial |
arxiv-286 | 0705.1214 | Control of Complex Systems Using Bayesian Networks and Genetic Algorithm | <|reference_start|>Control of Complex Systems Using Bayesian Networks and Genetic Algorithm: A method based on Bayesian neural networks and genetic algorithm is proposed to control the fermentation process. The relationship between input and output variables is modelled using Bayesian neural network that is trained usi... | arxiv | @article{marwala2007control,
title={Control of Complex Systems Using Bayesian Networks and Genetic Algorithm},
author={Tshilidzi Marwala},
journal={arXiv preprint arXiv:0705.1214},
year={2007},
archivePrefix={arXiv},
eprint={0705.1214},
primaryClass={cs.CE cs.NE}
} | marwala2007control |
arxiv-287 | 0705.1215 | Kinematic Calibration of the Orthoglide-Type Mechanisms | <|reference_start|>Kinematic Calibration of the Orthoglide-Type Mechanisms: The paper proposes a novel calibration approach for the Orthoglide-type mechanisms based on observations of the manipulator leg parallelism during motions between the prespecified test postures. It employs a low-cost measuring system composed o... | arxiv | @article{pashkevich2007kinematic,
title={Kinematic Calibration of the Orthoglide-Type Mechanisms},
author={Anatoly Pashkevich (Robotic Laboratory), Damien Chablat (IRCCyN),
Philippe Wenger (IRCCyN)},
journal={Symposium on Information Control Problems in Manufacturing (2006)
1-6},
year={2007},
ar... | pashkevich2007kinematic |
arxiv-288 | 0705.1217 | The Design of a Novel Prismatic Drive for a Three-DOF Parallel-Kinematics Machine | <|reference_start|>The Design of a Novel Prismatic Drive for a Three-DOF Parallel-Kinematics Machine: The design of a novel prismatic drive is reported in this paper. This transmission is based on Slide-O-Cam, a cam mechanism with multiple rollers mounted on a common translating follower. The design of Slide-O-Cam was ... | arxiv | @article{renotte2007the,
title={The Design of a Novel Prismatic Drive for a Three-DOF
Parallel-Kinematics Machine},
author={J'erome Renotte (IRCCyN), Damien Chablat (IRCCyN), Jorge Angeles
(CIM)},
journal={ASME Design Engineering Technical Conferences (2004) 1-10},
year={2007},
archivePrefix={ar... | renotte2007the |
arxiv-289 | 0705.1218 | Calibration of quasi-isotropic parallel kinematic Machines: Orthoglide | <|reference_start|>Calibration of quasi-isotropic parallel kinematic Machines: Orthoglide: The paper proposes a novel approach for the geometrical model calibration of quasi-isotropic parallel kinematic mechanisms of the Orthoglide family. It is based on the observations of the manipulator leg parallelism during motion... | arxiv | @article{pashkevich2007calibration,
title={Calibration of quasi-isotropic parallel kinematic Machines: Orthoglide},
author={Anatoly Pashkevich (ROBOTIC Laboratory), Roman Gomolitsky (ROBOTIC
Laboratory), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Fourth International Conference on Inform... | pashkevich2007calibration |
arxiv-290 | 0705.1227 | Rate Adaptation for Cognitive Radio under Interference from Primary Spectrum User | <|reference_start|>Rate Adaptation for Cognitive Radio under Interference from Primary Spectrum User: A cognitive radio can operate as a secondary system in a given spectrum. This operation should use limited power in order not to disturb the communication by primary spectrum user. Under such conditions, in this paper ... | arxiv | @article{popovski2007rate,
title={Rate Adaptation for Cognitive Radio under Interference from Primary
Spectrum User},
author={Petar Popovski, Hiroyuki Yomo, Kentaro Nishimori, and Rocco Di Taranto},
journal={arXiv preprint arXiv:0705.1227},
year={2007},
archivePrefix={arXiv},
eprint={0705.1227... | popovski2007rate |
arxiv-291 | 0705.1244 | Evolving Symbolic Controllers | <|reference_start|>Evolving Symbolic Controllers: The idea of symbolic controllers tries to bridge the gap between the top-down manual design of the controller architecture, as advocated in Brooks' subsumption architecture, and the bottom-up designer-free approach that is now standard within the Evolutionary Robotics c... | arxiv | @article{godzik2007evolving,
title={Evolving Symbolic Controllers},
author={Nicolas Godzik (INRIA Futurs, INRIA Rocquencourt), Marc Schoenauer
(INRIA Futurs, INRIA Rocquencourt), Mich`ele Sebag (INRIA Futurs, LRI)},
journal={Dans 4th European Workshop on Evolutionary Robotics, 2611 (2003)
638-650},
... | godzik2007evolving |
arxiv-292 | 0705.1271 | Design of a 3 Axis Parallel Machine Tool for High Speed Machining: The Orthoglide | <|reference_start|>Design of a 3 Axis Parallel Machine Tool for High Speed Machining: The Orthoglide: The Orthoglide project aims at designing a new 3-axis machine tool for High Speed Machining. Basis kinematics is a 3 degree-of-freedom translational parallel mechanism. This basis was submitted to isotropic and manipul... | arxiv | @article{majou2007design,
title={Design of a 3 Axis Parallel Machine Tool for High Speed Machining: The
Orthoglide},
author={F'elix Majou (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
(IRCCyN)},
journal={4\`eme Conf\'erence Internationale sur la Conception et la
fabrication Int\'egr\'ees en M\'ec... | majou2007design |
arxiv-293 | 0705.1272 | The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators | <|reference_start|>The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators: The subject of this paper is a special class of parallel manipulators. First, we analyze a family of three-degree-of-freedom manipulators. Two Jacobian matrices appear in the kinematic relations between the joint-rate and the Cartesi... | arxiv | @article{chablat2007the,
title={The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators},
author={Damien Chablat (IRCCyN), St'ephane Caro (IRCCyN), Philippe Wenger
(IRCCyN), Jorge Angeles (CIM)},
journal={4\`eme Conf\'erence Internationale sur la Conception et la
fabrication Int\'egr\'ees en ... | chablat2007the |
arxiv-294 | 0705.1280 | A Novel method for the design of 2-DOF Parallel mechanisms for machining applications | <|reference_start|>A Novel method for the design of 2-DOF Parallel mechanisms for machining applications: Parallel Kinematic Mechanisms (PKM) are interesting alternative designs for machine tools. A design method based on velocity amplification factors analysis is presented in this paper. The comparative study of two s... | arxiv | @article{majou2007a,
title={A Novel method for the design of 2-DOF Parallel mechanisms for machining
applications},
author={F'elix Majou (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
(IRCCyN)},
journal={8th International Symposium on Advances in Robot Kinematics (2002)
1-11},
year={2007},
... | majou2007a |
arxiv-295 | 0705.1282 | Design of a Three-Axis Isotropic Parallel Manipulator for Machining Applications: The Orthoglide | <|reference_start|>Design of a Three-Axis Isotropic Parallel Manipulator for Machining Applications: The Orthoglide: The orthoglide is a 3-DOF parallel mechanism designed at IRCCyN for machining applications. It features three fixed parallel linear joints which are mounted orthogonally and a mobile platform which moves... | arxiv | @article{wenger2007design,
title={Design of a Three-Axis Isotropic Parallel Manipulator for Machining
Applications: The Orthoglide},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Workshop on Fundamental Issues and Future Research Directions for
Parallel Mechanisms and Manipulators... | wenger2007design |
arxiv-296 | 0705.1284 | Workspace Analysis of the Orthoglide using Interval Analysis | <|reference_start|>Workspace Analysis of the Orthoglide using Interval Analysis: This paper addresses the workspace analysis of the orthoglide, a 3-DOF parallel mechanism designed for machining applications. This machine features three fixed parallel linear joints which are mounted orthogonally and a mobile platform wh... | arxiv | @article{chablat2007workspace,
title={Workspace Analysis of the Orthoglide using Interval Analysis},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Jean-Pierre Merlet
(COPRIN)},
journal={8th International Symposium on Advances in Robot Kinematics,
Kluwer Academic Publishers (2002) 1-10},
... | chablat2007workspace |
arxiv-297 | 0705.1285 | P\'eriph\'eriques haptiques et simulation d'objets, de robots et de mannequins dans un environnement de CAO-Robotique : eM-Virtual Desktop | <|reference_start|>P\'eriph\'eriques haptiques et simulation d'objets, de robots et de mannequins dans un environnement de CAO-Robotique : eM-Virtual Desktop: This paper presents the development of a new software in order to manage objects, robots and mannequins in using the possibilities given by the haptic feedback o... | arxiv | @article{chablat2007p\'eriph\'eriques,
title={P\'eriph\'eriques haptiques et simulation d'objets, de robots et de
mannequins dans un environnement de CAO-Robotique : eM-Virtual Desktop},
author={Damien Chablat (IRCCyN), Fouad Bennis (IRCCyN), Bernard Hoessler,
Matthieu Guibert},
journal={Virtual Concept... | chablat2007p\'eriph\'eriques |
arxiv-298 | 0705.1288 | Predicting the Presence of Internet Worms using Novelty Detection | <|reference_start|>Predicting the Presence of Internet Worms using Novelty Detection: Internet worms cause billions of dollars in damage yearly, affecting millions of users worldwide. For countermeasures to be deployed timeously, it is necessary to use an automated system to detect the spread of a worm. This paper disc... | arxiv | @article{marais2007predicting,
title={Predicting the Presence of Internet Worms using Novelty Detection},
author={E. Marais, T. Marwala},
journal={arXiv preprint arXiv:0705.1288},
year={2007},
archivePrefix={arXiv},
eprint={0705.1288},
primaryClass={cs.CR}
} | marais2007predicting |
arxiv-299 | 0705.1309 | Robust Multi-Cellular Developmental Design | <|reference_start|>Robust Multi-Cellular Developmental Design: This paper introduces a continuous model for Multi-cellular Developmental Design. The cells are fixed on a 2D grid and exchange "chemicals" with their neighbors during the growth process. The quantity of chemicals that a cell produces, as well as the differ... | arxiv | @article{devert2007robust,
title={Robust Multi-Cellular Developmental Design},
author={Alexandre Devert (INRIA Futurs), Nicolas Bred`eche (INRIA Futurs),
Marc Schoenauer (INRIA Futurs)},
journal={Dans Genetic and Evolutionary Computation COnference (2007)},
year={2007},
archivePrefix={arXiv},
... | devert2007robust |
arxiv-300 | 0705.1329 | Third Order Newton's Method for Zernike Polynomial Zeros | <|reference_start|>Third Order Newton's Method for Zernike Polynomial Zeros: The Zernike radial polynomials are a system of orthogonal polynomials over the unit interval with weight x. They are used as basis functions in optics to expand fields over the cross section of circular pupils. To calculate the roots of Zernik... | arxiv | @article{mathar2007third,
title={Third Order Newton's Method for Zernike Polynomial Zeros},
author={Richard J. Mathar},
journal={arXiv preprint arXiv:0705.1329},
year={2007},
archivePrefix={arXiv},
eprint={0705.1329},
primaryClass={math.NA cs.NA}
} | mathar2007third |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.