CoRR, April 2009

• Tad Hogg, Kristina Lerman:
  Stochastic Models of User-Contributory Web Sites.
  
• Josep Argelich, Inês Lynce, João P. Marques Silva:
  On Solving Boolean Multilevel Optimization Problems.
  
• Marko A. Rodriguez, Jennifer H. Watkins:
  Faith in the Algorithm, Part 2: Computational Eudaemonics.
  
• Youssef Hamadi, Saïd Jabbour, Lakhdar Sais:
  Learning for Dynamic subsumption.
  
• Mario R. F. Benevides, L. Menasché Schechter:
  CCS-Based Dynamic Logics for Communicating Concurrent Programs.
  
• Anders Høst-Madsen:
  Deterministic Capacity of MIMO Relay Networks.
  
• Anatoly Pashkevich, Damien Chablat, Philippe Wenger:
  Stiffness Analysis of Overconstrained Parallel Manipulators.
  
• Damien Chablat, Stefan Staicu:
  Kinematics of A 3-PRP planar parallel robot.
  
• Michael Huber:
  Authentication and Secrecy Codes for Equiprobable Source Probability Distributions.
  
• Raza Ur-Rehman, Stéphane Caro, Damien Chablat, Philippe Wenger:
  Kinematic and Dynamic Analysis of the 2-DOF Spherical Wrist of Orthoglide 5-axis.
  
• Pascal Mérindol, Jean-Jacques Pansiot, Stéphane Cateloin:
  The mdt algorithm.
  
• Peng Wu, Nihar Jindal:
  Coding Versus ARQ in Fading Channels: How reliable should the PHY be?
  
• Genady Grabarnik, Aaron Kershenbaum:
  Safe Reasoning Over Ontologies.
  
• Viveck R. Cadambe, Syed Ali Jafar, Chenwei Wang:
  Interference Alignment with Asymmetric Complex Signaling - Settling the Host-Madsen-Nosratinia Conjecture.
  
• Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt Rubinfeld:
  Sublinear Time Algorithms for Earth Mover's Distance.
  
• Gennady Agre, Petar Kormushev, Ivan Dilov:
  INFRAWEBS axiom editor - a graphical ontology-driven tool for creating complex logical expressions.
  
• Petar Kormushev:
  Design, development and implementation of a tool for construction of declarative functional descriptions of semantic web services based on WSMO methodology.
  
• Masahito Hayashi:
  Exponential evaluations in universal random privacy amplification.
  
• Petar Kormushev:
  Visual approach for data mining on medical information databases using Fastmap algorithm.
  
• Shlomi Dolev, Yuval Elovici, Rami Puzis, Polina Zilberman:
  Incremental Deployment of Network Monitors Based on Group Betweenness Centrality.
  
• Vincent Rialle, Catherine Ollivet, Carole Guigui, Christian Hervé:
  What Do Family Caregivers of Alzheimer's Disease Patients Desire in Smart Home Technologies?
  
• J. M. Landsberg, Jason Morton, Serguei Norine:
  Holographic algorithms without matchgates.
  
• Fang Wu, Bernardo A. Huberman:
  Persistence and Success in the Attention Economy.
  
• Yonina C. Eldar, Holger Rauhut:
  Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation.
  
• Zhi-Han Gao, Fang-Wei Fu:
  The Minimal Polynomial over F_q of Linear Recurring Sequence over F_{q^m}.
  
• Pabitra Pal Choudhury, Sudhakar Sahoo, Birendra Kumar Nayak, Sarif Sk. Hassan:
  Theory of Carry Value Transformation (CVT) and its Application in Fractal formation.
  
• Jaeok Park, Mihaela van der Schaar:
  Mission-Aware Medium Access Control in Random Access Networks.
  
• Petar Kormushev, Kohei Nomoto, Fangyan Dong, Kaoru Hirota:
  Time Hopping technique for faster reinforcement learning in simulations.
  
• Petar Kormushev, Kohei Nomoto, Fangyan Dong, Kaoru Hirota:
  Eligibility Propagation to Speed up Time Hopping for Reinforcement Learning.
  
• Georg Moser, Andreas Schnabl:
  The Derivational Complexity Induced by the Dependency Pair Method.
  
• Gergely Lukácsy, Péter Szeredi:
  Efficient Description Logic Reasoning in Prolog: The DLog system.
  
• Karthekeyan Chandrasekaran, Daniel Dadush, Santosh Vempala:
  Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families.
  
• Abbas Dideban, Meisam Zareiee, Hassane Alla:
  Controller synthesis with very simplified linear constraints in PN model.
  
• Hassane Alla:
  Optimal Supervisory Control Synthesis.
  
• Van Hung Le, Fei Liu, Dinh Khang Tran:
  Fuzzy Linguistic Logic Programming and its Applications.
  
• David N. Levin:
  Performing Nonlinear Blind Source Separation with Signal Invariants.
  
• Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng:
  Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities.
  
• Nisheeth Srivastava:
  Evolvability need not imply learnability.
  
• Michaela Götz, Ashwin Machanavajjhala, Guozhang Wang, Xiaokui Xiao, Johannes Gehrke:
  Privacy in Search Logs.
  
• M. Rémon:
  The "P-NP" problem and the deterministic or time-independent nature of Mathematics.
  
• Sergey Andreyev:
  Moveable objects and applications, based on them.
  
• Linh Anh Nguyen, Andrzej Szalas:
  Optimal Tableau Decision Procedures for PDL.
  
• Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
  (Meta) Kernelization.
  
• Jaime Anguita, Michael Chertkov, Mark A. Neifeld, Bane V. Vasic:
  Bethe Free Energy Approach to LDPC Decoding on Memory Channels.
  
• Yasutada Oohama:
  Distributed Source Coding of Correlated Gaussian Remote Sources.
  
• Srimathy Srinivasan, Andrew Thangaraj:
  Codes on Planar Graphs.
  
• Ioannis Z. Koukoutsidis, Petros I. Papaioannou, Michael E. Theologou:
  Effect of cell residence time variance on the performance of an advanced paging algorithm.
  
• Richard G. Clegg, Raul Landa, Uli Harder, Miguel Rio:
  Evaluating and Optimising Models of Network Growth.
  
• Shachar Lovett:
  The density of weights of Generalized Reed--Muller codes.
  
• Azadeh Khaleghi, Frank R. Kschischang:
  Projective Space Codes for the Injection Metric.
  
• Corinna Cortes, Mehryar Mohri, Dmitry Pechyony, Ashish Rastogi:
  Stability Analysis and Learning Bounds for Transductive Regression Algorithms.
  
• Ivana Stojanovic, William Clement Karl:
  Imaging of moving targets with multi-static SAR using an overcomplete dictionary.
  
• Manish Anand, P. R. Kumar:
  On approximating Gaussian relay networks by deterministic networks.
  
• David Pritchard:
  Approximability of Sparse Integer Programs.
  
• Lorenzo Cappellari:
  On Superposition Coding for the Wyner-Ziv Problem.
  
• Michael Hay, Vibhor Rastogi, Gerome Miklau, Dan Suciu:
  Boosting the Accuracy of Differentially-Private Queries Through Consistency.
  
• Amelia Carolina Sparavigna:
  Color Dipole Moments for Edge Detection.
  
• Kohtaro Tadaki:
  A statistical mechanical interpretation of algorithmic information theory III: Composite systems and fixed points.
  
• Martin Avanzini, Georg Moser:
  Dependency Pairs and Polynomial Path Orders.
  
• Sahbi Sidhom:
  Approche conceptuelle par un processus d'annotation pour la représentation et la valorisation de contenus informationnels en intelligence économique (IE).
  
• Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga:
  A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs.
  
• Christophe Tournier, Sylvain Lavernhe, Claire Lartigue:
  5-axis High Speed Milling Optimisation.
  
• Kwamiwi Mawussi, Sylvain Lavernhe, Claire Lartigue:
  Usinage de poches en UGV - Aide au choix de stratégies.
  
• David Nowak:
  On formal verification of arithmetic-based cryptographic primitives.
  
• David Arthur, Bodo Manthey, Heiko Röglin:
  k-Means has Polynomial Smoothed Complexity.
  
• Xiujie Huang, Aleksandar Kavcic, Xiao Ma:
  Upper Bounds on the Capacities of Non-Controllable Finite-State Channels with/without Feedback.
  
• Björn Grohmann:
  A New Key-Agreement-Protocol.
  
• Arian Maleki:
  Coherence Analysis of Iterative Thresholding Algorithms.
  
• Navin Goyal, Luis Rademacher:
  Learning convex bodies is hard.
  
• Kang Ning, Hon Wai Leong:
  The Distribution and Deposition Algorithm for Multiple Sequences Sets.
  
• Raffaele Bruno, Vania Conan, Stéphane Rousseau:
  Maximizing the number of accepted flows in TDMA-based wireless ad hoc networks is APX-complete.
  
• Jinzhong Niu, Simon Parsons:
  An Investigation Report on Auction Mechanism Design.
  
• Marius Kleiner, Bixio Rimoldi:
  Asymptotically Optimal Joint Source-Channel Coding with Minimal Delay.
  
• Manabu Inuma, Akira Otsuka, Hideki Imai:
  Theoretical framework for constructing matching algorithms in biometric authentication systems.
  
• Monojit Choudhury, Animesh Mukherjee, Anupam Basu, Niloy Ganguly, Ashish Garg, Vaibhav Jalan:
  Language Diversity across the Consonant Inventories: A Study in the Framework of Complex Networks.
  
• Jean-Luc Fouquet, Jean-Marie Vanherpe:
  On the perfect matching index of bridgeless cubic graphs.
  
• Moritz Riede, Rico Schueppel, Kristian O. Sylvester-Hvid, Martin Kühne, Michael C. Röttger, Klaus Zimmermann, Andreas W. Liehr:
  On the Communication of Scientific Results: The Full-Metadata Format.
  
• Stephan Kreutzer:
  On the Parameterised Intractability of Monadic Second-Order Logic.
  
• Hao Zhang, Gang Li, Huadong Meng:
  A Class of Novel STAP Algorithms Using Sparse Recovery Technique.
  
• Jian Li, Barna Saha, Amol Deshpande:
  A Unified Approach to Ranking in Probabilistic Databases.
  
• Javier M. Paredes, Babak Hossein Khalaj, Alex B. Gershman:
  Cooperative Transmission for Wireless Relay Networks Using Low-Rate Feedback.
  
• Hooman Shirani-Mehr, Giuseppe Caire:
  MIMO Downlink Scheduling with Non-Perfect Channel State Knowledge.
  
• Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng:
  Reducibility Among Fractional Stability Problems.
  
• Chaomei Chen, Yue Chen, Mark Horowitz, Haiyan Hou, Zeyuan Liu, Donald Pellegrino:
  Towards an explanatory and computational theory of scientific discovery.
  
• Radha Krishna Ganti, Martin Haenggi:
  Spatial and Temporal Correlation of the Interference in ALOHA Ad Hoc Networks.
  
• Yaming Yu, Oliver Johnson:
  Concavity of entropy under thinning.
  
• Francesco Ranzato, Francesco Tapparo:
  Computing Stuttering Simulations.
  
• Luigi Santocanale, J. Robin B. Cockett:
  On the word problem for SP-categories, and the properties of two-way communication.
  
• Jianfeng Zhang, Guy Chavent, Jérôme Jaffré:
  Estimating nonlinearities in twophase flow in porous media.
  
• Pål Anders Floor, Tor A. Ramstad:
  On the Analysis of Shannon-Kotel'nikov Mappings.
  
• Fedor Zhdanov, Vladimir Vovk, Brian Burford, Dmitry Devetyarov, Ilia Nouretdinov, Alexander Gammerman:
  Online prediction of ovarian cancer.
  
• Andriy Myronenko, Xubo B. Song:
  On the closed-form solution of the rotation matrix arising in computer vision problems.
  
• Juan C. Meza, Scott Campbell, David H. Bailey:
  Mathematical and Statistical Opportunities in Cyber Security.
  
• Yoichi Yamazaki, Fangyan Dong, Yuta Masuda, Yukiko Uehara, Petar Kormushev, Hai An Vu, Phuc Quang Le, Kaoru Hirota:
  Fuzzy inference based mentality estimation for eye robot agent.
  
• Aaron Sterling:
  Self-Assembly of a Statistically Self-Similar Fractal.
  
• Yoichi Yamazaki, Fangyan Dong, Yuta Masuda, Yukiko Uehara, Petar Kormushev, Hai An Vu, Phuc Quang Le, Kaoru Hirota:
  Intent expression using eye robot for mascot robot system.
  
• Cedric Chauve, Aïda Ouangraoua:
  A 3-approximation algorithm for computing a parsimonious first speciation in the gene duplication model.
  
• Joost Vennekens, Marc Denecker, Maurice Bruynooghe:
  CP-logic: A Language of Causal Probabilistic Events and Its Relation to Logic Programming.
  
• Idan Goldenberg, David Burshtein:
  Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming.
  
• Walid Belkhir:
  Undirected Graphs of Entanglement 3.
  
• Walid Belkhir:
  The Star Height Hierarchy Vs. The Variable Hierarchy.
  
• Walid Belkhir:
  Closure Under Minors of Undirected Entanglement.
  
• Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli, Ioannis Milis:
  Bounded Max-Colorings of Graphs.
  
• Tarik Ait-Idir, Houda Chafnaji, Samir Saoudi:
  Turbo Packet Combining for Broadband Space-Time BICM Hybrid-ARQ Systems with Co-Channel Interference.
  
• Sugumar Murugesan, Philip Schniter:
  Joint Opportunistic Scheduling in Multi-Cellular Systems.
  
• Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard:
  Feedback-based online network coding.
  
• Julien Cassaigne, François Nicolas:
  On polynomial growth functions of D0L-systems.
  
• Sugumar Murugesan, Philip Schniter:
  Opportunistic Multiuser Scheduling in a Three State Markov-modeled Downlink.
  
• Roberto Bagnara, Patricia M. Hill, Enea Zaffanella:
  Exact Join Detection for Convex Polyhedra and Other Numerical Abstractions.
  
• Wei Zhang, Xiang-Gen Xia:
  A Design of Space-Time Block Codes Achieving Full Diversity with Partial Interference Cancellation Group Decoding.
  
• Usman A. Khan, Soummya Kar, José M. F. Moura:
  Higher Dimensional Consensus: Learning in Large-Scale Networks.
  
• Stevan Harnad:
  On Fodor on Darwin on Evolution.
  
• Stevan Harnad:
  First Person Singular.
  
• Tal Philosof, Ram Zamir, Uri Erez, Ashish Khisti:
  Lattice Strategies for the Dirty Multiple Access Channel.
  
• Shenghao Yang, Raymond W. Yeung, Chi Kin Ngai:
  Refined Coding Bounds and Code Constructions for Coherent Network Error Correction.
  
• Stéphane Grumbach, Zhilin Wu:
  On Distributed Model Checking of MSO on Graphs.
  
• Qi Chen, Chen He, Ling-ge Jiang, Qingchuan Wang:
  Average Entropy Functions.
  
• Andriyan Bayu Suksmono:
  Compressive Sampling with Known Spectral Energy Density.
  
• Stéphane Grumbach, Zhilin Wu:
  Logical locality entails frugal distributed computation over graphs.
  
• Zhilin Wu, Stéphane Grumbach:
  Feasibility of Motion Planning on Acyclic and Strongly Connected Directed Graphs.
  
• Vincent Limouzy:
  Seidel Minor, Permutation Graphs and Combinatorial Properties.
  
• Obi L. Griffith, Byron J. Gao, Mikhail Bilenky, Yuliya Prichyna, Martin Ester, Steven J. M. Jones:
  KiWi: A Scalable Subspace Clustering Algorithm for Gene Expression Analysis.
  
• Vaneet Aggarwal, Lalitha Sankar, A. Robert Calderbank, H. Vincent Poor:
  Ergodic Layered Erasure One-Sided Interference Channels.
  
• Zi-Ke Zhang, Tao Zhou, Yi-Cheng Zhang:
  Personalized Recommendation via Integrated Diffusion on User-Item-Tag Tripartite Graphs.
  
• David I. Spivak:
  Simplicial Databases.
  
• J. Xie, Y. Jiang:
  Stochastic Service Guarantee Analysis Based on Time-Domain Models.
  
• Roxana Smarandache, Pascal O. Vontobel:
  Absdet-Pseudo-Codewords and Perm-Pseudo-Codewords: Definitions and Properties.
  
• Björn Grohmann:
  A new Protocol for 1-2 Oblivious Transfer.
  
• Jelani Nelson, David P. Woodruff:
  A Near-Optimal Algorithm for L1-Difference.
  
• Tao Chen, Honggang Zhang, Marcos D. Katz:
  Cloud Networking Formation in CogMesh Environment.
  
• Chunhua Shen, Hanxi Li:
  Boosting through Optimization of Margin Distributions.
  
• Ewout van den Berg, Michael P. Friedlander:
  Joint-sparse recovery from multiple measurements.
  
• Chandan Saha, Ramprasad Saptharishi, Nitin Saxena:
  The Power of Depth 2 Circuits over Algebras.
  
• Zhigang Cao, Xiaoguang Yang:
  Complementary Weighted Multiple Majority Games.
  
• Zhigang Cao, Xiaoguang Yang:
  Selfish Bin Covering.
  
• Roberto M. Amadio:
  On stratified regions.
  
• Christophe Domingues, Samir Otmane, Frédéric Davesne, Malik Mallem:
  A Distributed Software Architecture for Collaborative Teleoperation based on a VR Platform and Web Application Interoperability.
  
• Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian:
  Colorful Strips.
  
• Tamara Mchedlidze, Antonios Symvonis:
  Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs.
  
• Sonia Estévez Martín, Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo, Rafael del Vado Vírseda, Fernando Sáenz-Pérez, Antonio J. Fernández:
  On the Cooperation of the Constraint Domains H, R and FD in CFLP.
  
• Debprakash Patnaik, Srivatsan Laxman, Naren Ramakrishnan:
  Inferring Dynamic Bayesian Networks using Frequent Episode Mining.
  
• Imran A. Pirwani, Mohammad R. Salavatipour:
  A PTAS for Minimum Clique Partition in Unit Disk Graphs.
  
• Jinquan Luo:
  On Binary Cyclic Codes with Five Nonzero Weights.
  
• Juha Honkala:
  The equality problem for infinite words generated by primitive morphisms.
  
• Saloua Chettibi:
  A Comprehensive study of a New Multipath Energy Aware Routing Protocol for Mobile Ad-hoc Networks.
  
• Chan Zhou, Gerhard Wunder:
  A Fundamental Characterization of Stability in Broadcast Queueing Systems.
  
• Ching-Lueh Chang, Yuh-Dauh Lyuu:
  On irreversible dynamic monopolies in general graphs.
  
• Piotr Berman, Marek Karpinski, Andrzej Lingas:
  Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications.
  
• Tsachy Weissman, Haim H. Permuter:
  Source Coding with a Side Information "Vending Machine".
  
• Sherief Abdallah:
  Why Global Performance is a Poor Metric for Verifying Convergence of Multi-agent Learning.
  
• Carsten Schneider:
  A Symbolic Summation Approach to Find Optimal Nested Sum Representations.
  
• Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi:
  Explicit fairness in testing semantics.
  
• Akiko Manada, Navin Kashyap:
  The Zeta Function of a Periodic-Finite-Type Shift.
  
• Stefan Milius, Lawrence S. Moss:
  The Category Theoretic Solution of Recursive Program Schemes.
  
• Patrick Briest, Shuchi Chawla, Robert D. Kleinberg, S. Matthew Weinberg:
  Pricing Randomized Allocations.
  
• S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari:
  A Combinatorial Study of Linear Deterministic Relay Networks.
  
• Rasmus M. Jacobsen, Karsten Fyhn Nielsen, Petar Popovski, Torben Larsen:
  Reliable Identification of RFID Tags Using Multiple Independent Reader Sessions.
  
• Francesc Rosselló, Gabriel Valiente:
  All that Glisters is not Galled.
  
• Marc Mezzarobba, Bruno Salvy:
  Effective Bounds for P-Recursive Sequences.
  
• Emmanuel Jeandel, Guillaume Theyssier:
  Subshifts, Languages and Logic.
  
• Peter Harremoës:
  Joint Range of Rényi Entropies.
  
• Alexandre Graell i Amat, Eirik Rosnes:
  Good Concatenated Code Ensembles for the Binary Erasure Channel.
  
• Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak:
  One-Counter Markov Decision Processes.
  
• Florent R. Madelaine:
  Universal Structures and the logic of Forbidden Patterns.
  
• David H. Wolpert, Gregory Benford:
  What does Newcomb's paradox teach us?
  
• Heidi Gebauer:
  Disproof of the Neighborhood Conjecture with Implications to SAT.
  
• Anil Maheshwari, Stefanie Wuhrer:
  Geodesic Paths On 3D Surfaces: Survey and Open Problems.
  
• Anna Adamaszek, Artur Czumaj, Andrzej Lingas:
  PTAS for k-tour cover problem on the plane for moderately large values of k.
  
• José Avelino Manzano Lizcano, Samuel Ángel Jaramillo Flórez:
  New technologies for high speed computer networks: a wavelet approach.
  
• Brice Djeumou, Elena Veronica Belmega, Samson Lasaulce:
  Interference Relay Channels - Part I: Transmission Rates.
  
• Elena Veronica Belmega, Brice Djeumou, Samson Lasaulce:
  Interference Relay Channels - Part II: Power Allocation Games.
  
• Mark Levene, Trevor I. Fenner:
  A Methodology for Learning Players' Styles from Game Records.
  
• James Petterson, Tibério S. Caetano, Julian John McAuley, Jin Yu:
  Exponential Family Graph Matching and Ranking.
  
• Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann:
  Better Quality in Synthesis through Quantitative Objectives.
  
• Jean Daligault, Stéphan Thomassé:
  On Finding Directed Trees with Many Leaves.
  
• Ugo Dal Lago, Martin Hofmann:
  Bounded Linear Logic, Revisited.
  
• LianLin Li, Wenji Zhang, Fang Li:
  Compressive Diffraction Tomography for Weakly Scattering.
  
• Mingyu Xiao:
  New Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs.
  
• Clémence Magnien, Frédéric Ouédraogo, Guillaume Valadon, Matthieu Latapy:
  Fast dynamics in Internet topology: preliminary observations and explanations.
  
• MinJi Kim, Luísa Lima, Fang Zhao, João Barros, Muriel Médard, Ralf Koetter, Ton Kalker, Keesook J. Han:
  On Counteracting Byzantine Attacks in Network Coded Peer-to-Peer Networks.
  
• Clémence Magnien, Matthieu Latapy, Michel Habib:
  Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs.
  
• Fabien Viger, Brice Augustin, Xavier Cuvellier, Clémence Magnien, Matthieu Latapy, Timur Friedman, Renata Teixeira:
  Detection, Understanding, and Prevention of Traceroute Measurement Artifacts.
  
• Andrea Montanari, Ricardo Restrepo, Prasad Tetali:
  Reconstruction and Clustering in Random Constraint Satisfaction Problems.
  
• Frédéric Chyzak, Manuel Kauers, Bruno Salvy:
  A Non-Holonomic Systems Approach to Special Function Identities.
  
• Amit K. Awasthi, Sanjay Chaudhary:
  Non Homogeneous Poisson Process Model based Optimal Modular Software Testing using Fault Tolerance.
  
• Daniel Král:
  Decomposition width - a new width parameter for matroids.
  
• (paper retracted).
• Sergei V. Fedorenko:
  A simple algorithm for decoding both errors and erasures of Reed-Solomon codes.
  
• Prabir Barooah, João P. Hespanha:
  Error Scaling Laws for Linear Optimal Estimation from Relative Measurements.
  
• Manfred Kufleitner, Pascal Weil:
  On FO2 quantifier alternation over words.
  
• Amir Hamed Mohsenian Rad, Jianwei Huang, Vincent W. S. Wong, Sidharth Jaggi, Robert Schober:
  Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of Network Coding.
  
• Fahem Kebair, Frédéric Serin:
  Towards an Intelligent System for Risk Prevention and Management.
  
• Fahem Kebair, Frédéric Serin:
  Agent-Based Decision Support System to Prevent and Manage Risk Situations.
  
• Carl Hewitt:
  Middle History of Logic Programming.
  
• Heping Hu, Yingyu Zhang, Zhengding Lu:
  An efficient quantum search engine on unsorted database.
  
• Miklós Csürös:
  Approximate counting with a floating-point counter.
  
• Carlos M. Fernandes, Juan Julián Merelo Guervós, Agostinho C. Rosa:
  Using Dissortative Mating Genetic Algorithms to Track the Extrema of Dynamic Deceptive Functions.
  
• Michael A. Popov:
  P vs NP Problem in the field anthropology.
  
• Arnaud Casteigts, Serge Chaumette, Frédéric Guinand, Yoann Pigné:
  Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks.
  
• Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
  Counting Paths and Packings in Halves.
  
• Daniil Musatov, Andrei E. Romashchenko, Alexander Shen:
  Variations on Muchnik's Conditional Complexity Theorem.
  
• Hao Chen:
  CRT-Based High Speed Parallel Architecture for Long BCH Encoding.
  
• Takeaki Uno, Masashi Sugiyama, Koji Tsuda:
  Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method.
  
• Stéphane Grumbach, Fang Wang, Zhilin Wu:
  On the distributed evaluation of recursive queries over graphs.
  
• David N. C. Tse, Roy D. Yates:
  Fading Broadcast Channels with State Information at the Receivers.
  
• Christoph Dürr, Flavio Guiñez, Martín Matamala:
  Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard.
  
• Fredrik Kuivinen:
  On the Complexity of Submodular Function Minimisation on Diamonds.
  
• Oussama Allali, Matthieu Latapy, Clémence Magnien:
  Measurement of eDonkey Activity with Distributed Honeypots.
  
• Fabien Tarissan, Matthieu Latapy, Christophe Prieur:
  Efficient Measurement of Complex Networks Using Link Queries.
  
• Manuel Oriol:
  The Business of Selling Electronic Documents.
  
• Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto:
  On evaluation of permanents.
  
• John S. Hamel:
  A Thermodynamic Turing Machine: Artificial Molecular Computing Using Classical Reversible Logic Switching Networks.
  
• Shariq Bashir, Abdul Rauf Baig:
  FastLMFI: An Efficient Approach for Local Maximal Patterns Propagation and Maximal Patterns Superset Checking.
  
• Shariq Bashir, Abdul Rauf Baig:
  HybridMiner: Mining Maximal Frequent Itemsets Using Hybrid Database Representation Approach.
  
• Shariq Bashir, Abdul Rauf Baig:
  Ramp: Fast Frequent Itemset Mining with Efficient Bit-Vector Projection Technique.
  
• Shariq Bashir, Zahoor Jan, Abdul Rauf Baig:
  Fast Algorithms for Mining Interesting Frequent Itemsets without Minimum Support.
  
• Shariq Bashir, Saad Razzaq, Umer Maqbool, Sonya Tahir, Abdul Rauf Baig:
  Using Association Rules for Better Treatment of Missing Values.
  
• Shariq Bashir, Saad Razzaq, Umer Maqbool, Sonya Tahir, Abdul Rauf Baig:
  Introducing Partial Matching Approach in Association Rules for Better Treatment of Missing Values.
  
• Michael Ummels, Dominik Wojtczak:
  Decision Problems for Nash Equilibria in Stochastic Games.
  
• Chris Gioran, Ioannis Kontoyiannis:
  Lossy Compression in Near-Linear Time via Efficient Random Codebooks and Databases.
  
• Majid Fozunbal:
  A Subsequence-Histogram Method for Generic Vocabulary Recognition over Deletion Channels.
  
• Istvan Szita, András Lörincz:
  Optimistic Initialization and Greediness Lead to Polynomial Time Learning in Factored MDPs - Extended Version.
  
• Yoav Freund:
  A method for Hedging in continuous time.
  
• Mark Daley, Michael Domaratzki, Kai Salomaa:
  State complexity of orthogonal catenation.
  
• Sunder Lal, Vandani Verma:
  Identity Based Strong Designated Verifier Parallel Multi-Proxy Signature Scheme.
  
• Sunder Lal, Vandani Verma:
  Some Proxy Signature and Designated verifier Signature Schemes over Braid Groups.
  
• Bhupendra Gupta:
  Comment to "Coverage by Randomly Deployed Wireless Sensor Networks".
  
• Praveen Sivadasan, P. Sojan Lal:
  JConstHide: A Framework for Java Source Code Constant Hiding.
  
• Giorgi Japaridze:
  Toggling operators in computability logic.
  
• Sayan Bhattacharya, Vincent Conitzer, Kamesh Munagala, Lirong Xia:
  Incentive Compatible Budget Elicitation in Multi-unit Auctions.
  
• Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro:
  On the Complexity of Searching in Trees: Average-case Minimization.
  
• David Monniaux:
  On using floating-point computations to help an exact linear arithmetic decision procedure.
  
• Pierre Lescanne:
  Deconstruction of Infinite Extensive Games using coinduction.
  
• Papin Nicolae, Tiberiu Marius Karnyanszky:
  Internet: Romania vs. Europe.
  
• Bican Xia, Zhihai Zhang:
  Termination of Linear Programs with Nonlinear Constraints.
  
• Florian Huc, Aubin Jarry:
  VRAC: Virtual Raw Anchor Coordinates Routing in Sensor Networks -- Concepts and Experimental Protocol.
  
• Florentin Neumann, Andrea Reichenberger, Martin Ziegler:
  Variations of the Turing Test in the Age of Internet and Virtual Reality.
  
• Diana Sophia Codat:
  Les technologies de l'information et de la communication au niveau mondial et en Roumanie dans les dernieres annees.
  
• Ioan Despi, Lucian Luca:
  On the Ambiguity of Commercial Open Source.
  
• Alexandra Fortis:
  Business Process Modeling Notation - An Overview.
  
• Florin Fortis, Alexandra Fortis:
  Tailored business solutions by workflow technologies.
  
• Vladimir V. Gotsulenko, Lyudmila A. Gaponova:
  On one method of boundary value problem regularization by passage to the limit.
  
• Farzan Haddadi, Mohammad Mahdi Nayebi, Mohammad Reza Aref:
  Direction-of-Arrival Estimation for Temporally Correlated Narrowband Signals.
  
• Tiberiu Marius Karnyanszky, Mihai Titu:
  Computer Aided Optimization of the Unconventional Processing.
  
• Dan L. Lacrama, Ioan Snep:
  The use of invariant moments in hand-written character recognition.
  
• Amnon Shashua:
  Introduction to Machine Learning: Class Notes 67577.
  
• Alin Munteanu, Cristina Ofelia Sofran:
  Considerations upon the Machine Learning Technologies.
  
• Alin Munteanu, Cristina Ofelia Sofran:
  Collaborative systems and multiagent systems.
  
• Arindam Mitra:
  Quantum theory can be collectively verified.
  
• Dieter Penteliuc Cotosman:
  The Multimedia Product - between Design and Information, Design and Utility and Design and Entertainment.
  
• Dieter Penteliuc-Cotosman:
  The new multimedia educational technologies, used in open and distance learning.
  
• Rolf Andreas Rasenack, Karsten Wolke, Kostyantyn Yermashov, Karl Hayo Siemsen:
  Semantic Linkage of Control Systems.
  
• Guillaume Erétéo, Fabien L. Gandon, Olivier Corby, Michel Buffa:
  Semantic Social Network Analysis.
  
• Mihai Timis:
  Output Width Signal Control In Asynchronous Digital Systems Using External Clock Signal.
  
• Mihai Timis:
  Output Width Signal Control In Asynchronous Digital Systems Using Monostable Circuits.
  
• Radu Vultur:
  Mesh.
  
• Karsten Wolke, Kostyantyn Yermashov, K. H. Siemsen, Rolf Andreas Rasenack:
  Failover of Software Services with State Replication.
  
• Kostyantyn Yermashov, K. H. Siemsen, Karsten Wolke, Rolf Andreas Rasenack:
  Architecture of the Neurath Basic Model View Controller.
  
• David Eppstein, Emma S. Spiro:
  The h-Index of a Graph and its Application to Dynamic Subgraph Statistics.
  
• Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker:
  On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem.
  
• Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller:
  Approximate Triangle Counting.
  
• Roy C. Timo, Kim Blackmore, Leif Hanlen:
  Word-Valued Sources: an Ergodic Theorem, an AEP and the Conservation of Entropy.
  
• Serguei A. Mokhov, Joey Paquet:
  Formally Specifying and Proving Operational Aspects of Forensic Lucid in Isabelle.
  
• Reginald D. Smith:
  Internet Traffic Periodicities and Oscillations: A Brief Review.
  
• Forrest Sheng Bao, Jue-Ming Gao, Jing Hu, Donald Yu-Chun Lie, Yuanlin Zhang, K. J. Oommen:
  Automated Epilepsy Diagnosis Using Interictal Scalp EEG.
  
• Annick Valibouze:
  La Résolvante de Lagrange et ses Applications.
  
• Jörg Bühler, Gerhard Wunder:
  On Capacity Computation for the Two-User Binary Multiple-Access Channel.
  
• Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi:
  On Smoothed Analysis of Quicksort and Hoare's Find.
  
• Frank Ferraro, Garrett Hall, Andrew Wood:
  Refutation of Aslam's Proof that NP = P.
  
• Andrew Keenan Richardson, Cole Arthur Brown:
  A Critique of "Solving the P/NP Problem Under Intrinsic Uncertainty".
  
• Sagarmoy Dutta, Piyush P. Kurur:
  Representating groups on graphs.
  
• Christopher O. Ward:
  Better Global Polynomial Approximation for Image Rectification.
  
• V. Wiktor Marek, Jeffrey B. Remmel:
  Guarded resolution for answer set programming.
  
• Ramachandran Rajesh, Vinod Sharma, V. K. Varshenya:
  Joint Source-Channel Coding on a Multiple Access Channel with Side Information.
  
• Yong Yao:
  Termination of the Sequence of SDS Sets and Machine Decision for Positive Semi-definite Forms.
  
• Jie Luo, Mario A. Nascimento:
  Content-Based Sub-Image Retrieval with Relevance Feedback.
  
• Saloua Chettibi:
  Un protocole de routage à basse consommation d'énergie pour les MANETs.
  
• Zhenning Kong, Salah A. Aly, Emina Soljanin:
  Decentralized Coding Algorithms for Distributed Storage in Wireless Sensor Networks.
  
• Jeff Arnold, Tim Abbott, Waseem Daher, Gregory Price, Nelson Elhage, Geoffrey Thomas, Anders Kaseorg:
  Security impact ratings considered harmful.
  
• Agnes Hui Chan, Rajmohan Rajaraman, Zhifeng Sun, Feng Zhu:
  Approximation Algorithms for Key Management in Secure Multicast.
  
• Ioannis Z. Emiris, Angelos Mantzaflaris:
  Multihomogeneous Resultant Formulae for Systems with Scaled Support.
  
• Mikolaj Bojanczyk:
  Two-Way Unary Temporal Logic over Trees.
  
• Ugo Dal Lago, Simone Martini:
  On Constructor Rewrite Systems and the Lambda-Calculus.
  
• Danny van Dyk, Markus Geveler, Sven Mallach, Dirk Ribbrock, Dominik Göddeke, Carsten Gutwenger:
  HONEI: A collection of libraries for numerical computations targeting multiple processor architectures.
  
• Jeong-woo Cho, Yuming Jiang:
  Fundamentals of the Backoff Process in 802.11.
  
• O. Ignatenko:
  Denial of service attack in the Internet: agent-based intrusion detection and reaction.
  
• Nicolas Bonnel, Pierre-Francois Marteau, Gildas Ménier:
  Parallel Random Apollonian Networks.
  
• Husam Alustwani, Jacques M. Bahi, Ahmed Mostefaoui, Michel Salomon:
  Java Technology : a Strategic Solution for Interactive Distributed Applications.
  
• Shahar Dobzinski, Shaddin Dughmi:
  On the Power of Randomization in Algorithmic Mechanism Design.
  
• Jérôme Lacan, Emmanuel Lochin, Pierre-Ugo Tournoux, Amine Bouabdallah, Vincent Roca:
  On-the-fly coding for time-constrained applications.
  
• Cong Shen, Michael P. Fitz:
  Opportunistic Spatial Orthogonalization and Its Application in Fading Cognitive Radio Networks.
  
• David Eppstein, Elena Mumford:
  Orientation-Constrained Rectangular Layouts.
  
• Prabhu Manyem:
  Lower Bounds on Syntactic Logic Expressions for Optimization Problems and Duality using Lagrangean Dual to characterize optimality conditions.
  
• Roland Tresch, Maxime Guillaud, Erwin Riegler:
  On the Achievability of Interference Alignment in the K-User Constant MIMO Interference Channel.
  
• Jean-Philippe Auzelle, Olivier Nartz, Jean-Yves Bron:
  Ingénierie système d'un système d'information d'entreprise centré sur le produit basée sur un cadre de modélisation multi-échelles : application à un cas d'étude de l'AIP lorrain.
  
• Anne Canteaut, María Naya-Plasencia:
  Computing the biases of parity-check relations.
  
• Lukas Kencl, Martin Loebl:
  DNA-Inspired Information Concealing.
  
• Michael T. Goodrich:
  The Mastermind Attack on Genomic Data.
  
• András Z. Salamon, Vashti Galpin:
  Bounds on series-parallel slowdown.
  
• Paul Tune, Sibiraj Bhaskaran Pillai, Stephen V. Hanly:
  Number of Measurements in Sparse Signal Recovery.
  
• Cenk M. Yetis, Syed Ali Jafar, Ahmet H. Kayran:
  Feasibility Conditions for Interference Alignment.
  
• Alberto Piatti, Marco Zaffalon, Fabio Trojani, Marcus Hutter:
  Limits of Learning about a Categorical Latent Variable under Prior Near-Ignorance.
  
• Fei Li, Zhi Zhang:
  Online Maximizing Weighted Throughput In A Fading Channel.
  
• Amin Aminzadeh Gohari, Venkat Anantharam:
  Evaluation of Marton's Inner Bound for the General Broadcast Channel.
  
• Amin Aminzadeh Gohari, Venkat Anantharam:
  A Generalized Cut-Set Bound.
  
• Juan Manuel Torres Moreno, Mirta B. Gordon:
  Adaptive Learning with Binary Neurons.
  
• Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper:
  Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts.
  
• Srivatsan Laxman, Basel Shadid, P. S. Sastry, K. P. Unnikrishnan:
  Temporal data mining for root-cause analysis of machine faults in automotive assembly lines.
  
• Swan Dubois, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil:
  Dynamic FTSS in Asynchronous Systems: the Case of Unison.
  
• Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu:
  Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric.
  
• Cyril Allauzen, Mehryar Mohri:
  Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton.
  
• George Tsatsaronis, Maria Halkidi, Emmanouel A. Giakoumakis:
  Quality Classifiers for Open Source Software Repositories.
  
• Dirk Beyer, Alessandro Cimatti, Alberto Griggio, M. Erkan Keremoglu, Roberto Sebastiani:
  Software Model Checking via Large-Block Encoding.
  
• Yi-Dong Shen, Jia-Huai You, Li-Yan Yuan:
  Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms.
  
• Ghadamali Bagherikaram, Abolfazl S. Motahari, Amir K. Khandani:
  The Secrecy Capacity Region of the Degraded Vector Gaussian Broadcast Channel.
  
• Brian M. Kurkoski, Justin Dauwels:
  Belief-Propagation Decoding of Lattices Using Gaussian Mixtures.
  
• Giulio Manzonetto:
  Models and theories of lambda calculus.
  
• Rémi Gribonval, Karin Schnass:
  Dictionary Identification - Sparse Matrix-Factorisation via $\ell_1$-Minimisation.
  
• Houda Chafnaji, Tarik Ait-Idir, Samir Saoudi, Athanasios V. Vasilakos:
  Frequency Domain Hybrid-ARQ Chase Combining for Broadband MIMO CDMA Systems.
  
• Nikolaos Mavridis, Shervin Emami, Chandan Datta, Wajahat Kazmi, Chiraz BenAbdelkader, Panos Toulis, Andry Tanoto, Tamer F. Rabie:
  FaceBots: Steps Towards Enhanced Long-Term Human-Robot Interaction by Utilizing and Publishing Online Social Information.
  
• Miquel Payaró, Daniel Pérez Palomar:
  On optimal precoding in linear vector Gaussian channels with arbitrary input distribution.
  
• Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Mooly Sagiv, Siddharth Srivastava, Greta Yorsh:
  Simulating reachability using first-order logic with applications to verification of linked data structures.
  
• Michael T. Goodrich:
  On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results.
  
• Athanasios S. Lioumpas, George K. Karagiannidis:
  Variable-Rate M-PSK Communications without Channel Amplitude Estimation.
  
• Danko Ilik, Gyesik Lee, Hugo Herbelin:
  Kripke Models for Classical Logic.
  
• G. A. Kohring:
  Complex Dependencies in Large Software Systems.
  
• Jonathan Asher Cohen:
  Coherence for rewriting 2-theories.
  
• Alejandro Lorca, José Luis Vázquez-Poletti, Eduardo Huedo, Ignacio Martín Llorente:
  Grid porting of Bhabha scattering code through a master-worker scheme.
  
• Vladimir V. Bytev, Mikhail Yu. Kalmykov, Bernd A. Kniehl:
  Differential reduction of generalized hypergeometric functions in application to Feynman diagrams: One-variable case.
  
• Michel Fliess, Cédric Join:
  Model-free control and intelligent PID controllers: towards a possible trivialization of nonlinear control?
  
• Marco Budinich:
  On Computational Complexity of Clifford Algebra.
  
• Lenka Zdeborová, Michael Chertkov:
  Message Passing for Optimization and Control of Power Grid: Toy Model of Distribution with Ancillary Lines.
  
• Vivien Robinet, Gilles Bisson, Mirta B. Gordon, Benoît Lemaire:
  Induction of High-level Behaviors from Problem-solving Traces using Machine Learning Tools.
  
• Weiyu Xu, M. Amin Khajehnejad, Amir Salman Avestimehr, Babak Hassibi:
  Breaking through the Thresholds: an Analysis for Iterative Reweighted $\ell_1$ Minimization via the Grassmann Angle Framework.
  
• Jaime Sanudo, Ricardo López-Ruiz:
  Alternative evaluation of statistical indicators in atoms: the non-relativistic and relativistic cases.
  
• Kohtaro Tadaki:
  Chaitin Omega numbers and halting problems.
  
• Oleg Pikhurko:
  Finding an Unknown Acyclic Orientation of a Given Graph.
  
• Mark Herrera, David C. Roberts, Natali Gulbahce:
  Mapping the evolution of scientific ideas.
  
• Sudhir R. Ghorpade, Sartaj Ul Hasan, Meena Kumari:
  Primitive Polynomials, Singer Cycles, and Word Oriented Linear Feedback Shift Registers.
  
• Antoine Sinton:
  Recovering the state sequence of hidden Markov models using mean-field approximations.
  
• M. Ángeles Serrano, Marián Boguñá, Alessandro Vespignani:
  Extracting the multiscale backbone of complex weighted networks.
  
• René David:
  A short proof that adding some permutation rules to beta preserves SN.
  
• Federico Ricci-Tersenghi, Guilhem Semerjian:
  On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms.
  
• Deanna Needell:
  Noisy Signal Recovery via Iterative Reweighted L1-Minimization.
  
• Solange Ghernaouti-Helie, Igli Tashi, Thomas Laenger, Christian Monyk:
  SECOQC Business White Paper.
  
• Jiansheng Yang, Yunying Zhang:
  On the Upper Bounds of MDS Codes.
  
• Arnab Bhattacharyya, Bernhard Haeupler:
  Robust Regulatory Networks.
  
• Yuri I. Manin:
  Renormalization and computation I: motivation and background.
  

Last update Fri May 17 19:53:25 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page