CoRR, June 2006

• David Steurer:
  Tight Bounds for the Min-Max Boundary Decomposition Cost of Weighted Graphs.
  
• Wei-jen Hsu, Debojyoti Dutta, Ahmed Helmy:
  Mining Behavioral Groups in Large Wireless LANs.
  
• Sergei Kojarski, David H. Lorenz:
  Modeling Aspect Mechanisms: A Top-Down Approach.
  
• Victor V. Kryssanov, V. A. Abramov, Hironori Hibino, Yoshiro Fukuda:
  A Framework for the Development of Manufacturing Simulators: Towards New Generation of Simulation Systems.
  
• Samuel Galice, Véronique Legrand, Marine Minier, John Mullins, Stéphane Ubéda:
  The KAA project: a trust policy point of view.
  
• Peter Wittenburg, Daan Broeder, Wolfgang Klein, Stephen Levinson, Laurent Romary:
  Foundations of Modern Language Resource Archives.
  
• Andrew Pavlo, Christopher Homan, Jonathan Schull:
  A parent-centered radial layout algorithm for interactive graph visualization and animation.
  
• Joan A. Smith, Martin Klein, Michael L. Nelson:
  Repository Replication Using NNTP and SMTP.
  
• Piotr Faliszewski, Lane A. Hemaspaandra:
  The Consequences of Eliminating NP Solutions.
  
• Victor V. Kryssanov, V. A. Abramov, Yoshiro Fukuda, K. Konishi:
  A Decision-Making Support System Based on Know-How.
  
• Hao Chen, Liang Ma, Jianhua Li:
  Vectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes.
  
• Maurice Margenstern:
  On the communication between cells of a cellular automaton on the penta- and heptagrids of the hyperbolic plane.
  
• Manuel Abellanas, António Leslie Bajuelos, Gregorio Hernández-Peñalver, Ferran Hurtado, Inês Matos, Belén Palop:
  Good Illumination of Minimum Range.
  
• Wei Wu, Sriram Vishwanath, Ari Arapostathis:
  On the Capacity of Multiple Access Channels with State Information and Feedback.
  
• Rajesh Sundaresan, Arun Padakandla:
  The Size of Optimal Sequence Sets for Synchronous CDMA Systems.
  
• Husheng Li, Sharon M. Betz, H. Vincent Poor:
  Performance Analysis of Iterative Channel Estimation and Multiuser Detection in Multipath DS-CDMA Channels.
  
• Victor V. Kryssanov, Koh Kakusho:
  From semiotics of hypermedia to physics of semiosis: A view from system theory.
  
• Matthias Bauer, Benjamin Fabian, Matthias Fischmann, Seda F. Gürses:
  Emerging Markets for RFID Traces.
  
• Roberto M. Amadio:
  A synchronous pi-calculus.
  
• Vadim Astakhov, Tamara Astakhova, Brian Sanders:
  Imagination as Holographic Processor for Text Animation.
  
• H. Tamaki, Victor V. Kryssanov, S. Kitamura:
  A simulation engine to support production scheduling using genetics-based machine learning.
  
• Kaibin Huang, Bishwarup Mondal, Robert W. Heath Jr., Jeffrey G. Andrews:
  Limited Feedback for Temporally-Correlated Channels: Feedback Rate and Delay.
  
• Santanu K. Maiti, S. N. Karmakar:
  Parallel Evaluation of Mathematica Programs in Remote Computers.
  
• Edgar H. de Graaf, Jeannette M. de Graaf, Walter A. Kosters:
  Consecutive Support: Better Be Close!
  
• Xiaowen Zhang, Li Shu, Ke Tang:
  A Chaotic Cipher Mmohocc and Its Security Analysis.
  
• Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen:
  Generating parity check equations for bounded-distance iterative erasure decoding.
  
• Victor V. Kryssanov, A. S. Kleshchev, Yoshiro Fukuda, K. Konishi:
  Building a logical model in the machining domain for CAPP expert systems.
  
• Evgeniya V. Adutskevich, S. V. Bakhanovich, Nickolai A. Likhoded:
  Affine Transformations of Loop Nests for Parallel Execution and Distribution of Data over Processors.
  
• Audun Jøsang:
  Belief Calculus.
  
• Véronique Cortier, Heinrich Hördegen, Bogdan Warinschi:
  Explicit Randomness is not Necessary when Modeling Probabilistic Encryption.
  
• Guillaume Moroz:
  Complexity of Resolution of Parametric Systems of Polynomial Equations and Inequations.
  
• Christian Hett, Nicolai Kuntze, Andreas U. Schmidt:
  A secure archive for Voice-over-IP conversations.
  
• Cristian S. Calude, Michael Stay:
  Natural Halting Probabilities, Partial Randomness, and Zeta Functions.
  
• Teddy Furon:
  A constructive and unifying framework for zero-bit watermarking.
  
• Sergei V. Fedorenko, Peter Vladimirovich Trifonov:
  Finding roots of polynomials over finite fields.
  
• Maarten H. van Emden, Belaid Moa:
  Computational Euclid.
  
• Andrej Bogdanov, Luca Trevisan:
  Average-Case Complexity.
  
• Shripad Thite:
  Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements.
  
• Victor V. Kryssanov, H. Tamaki, S. Kitamura:
  Evolutionary Design: Philosophy, Theory, and Application Tactics.
  
• Bodo Manthey, L. Shankar Ram:
  Approximation Algorithms for Multi-Criteria Traveling Salesman Problems.
  
• Ming-Zhe Chen:
  Characterization of Pentagons Determined by Two X-rays.
  
• Laurent Hascoët, Mauricio Araya-Polo:
  Enabling user-driven Checkpointing strategies in Reverse-mode Automatic Differentiation.
  
• Christian Artigues, Pierre Lopez, Pierre-Dimitri Ayache:
  Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis.
  
• Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg:
  Frugality ratios and improved truthful mechanisms for vertex cover.
  
• Nicolai Kuntze, Andreas U. Schmidt:
  Trusted Computing in Mobile Action.
  
• Jan Piechalski, Andreas U. Schmidt:
  Authorised Translations of Electronic Documents.
  
• Giorgios Kollias, Efstratios Gallopoulos, Daniel B. Szyld:
  Asynchronous iterative computations with Web information retrieval structures: The PageRank case.
  
• Rudi Cilibrasi, Paul M. B. Vitányi:
  A New Quartet Tree Heuristic for Hierarchical Clustering.
  
• Alexandros G. Dimakis, Vinod M. Prabhakaran, Kannan Ramchandran:
  Decentralized Erasure Codes for Distributed Networked Storage.
  
• Prabhu Manyem:
  Syntactic Characterisations of Polynomial-Time Optimisation Classes (Syntactic Characterizations of Polynomial-Time Optimization Classes).
  
• Shu-Tao Xia, Fang-Wei Fu:
  Minimum Pseudo-Weight and Minimum Pseudo-Codewords of LDPC Codes.
  
• Soummya Kar, Saeed A. Aldosari, José M. F. Moura:
  Topology for Distributed Inference on Graphs.
  
• Arnaud Carayol, Antoine Meyer:
  Context-Sensitive Languages, Rational Graphs and Determinism.
  
• Qiming Lu, Gyorgy Korniss, Boleslaw K. Szymanski:
  Threshold-Controlled Global Cascading in Wireless Sensor Networks.
  
• Jean H. Gallier:
  Simple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches.
  
• Jean H. Gallier, Weqing Gu:
  Fast and Simple Methods For Computing Control Points.
  
• Fredrik Kuivinen:
  Approximability of Bounded Occurrence Max Ones.
  
• Philippe Chapdelaine, Etienne Grandjean:
  Lower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes.
  
• Mridul Aanjaneya:
  Tromino tilings of Domino-Deficient Rectangles.
  
• Luciano da Fontoura Costa:
  Complex Networks: New Concepts and Tools for Real-Time Imaging and Vision.
  
• Jean H. Gallier:
  On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches.
  
• Leonid Libkin:
  Logics for Unranked Trees: An Overview.
  
• Adam J. Slagell, Kiran Lakkaraju, Katherine Luo:
  FLAIM: A Multi-level Anonymization Framework for Computer and Network Logs.
  
• Xin Li, Tian Liu, Han Peng, Hongtao Sun, Jiaqi Zhu:
  Improved Exponential Time Lower Bound of Knapsack Problem under BT model.
  
• Frank Neven, Thomas Schwentick:
  On the complexity of XPath containment in the presence of disjunction, DTDs, and variables.
  
• Audun Jøsang:
  The Cumulative Rule for Belief Fusion.
  
• Michael A. Bender, Raphaël Clifford, Kostas Tsichlas:
  Scheduling Algorithms for Procrastinators.
  
• Christian Hett, Nicolai Kuntze, Andreas U. Schmidt:
  Security and Non-Repudiation for Voice-Over-IP Conversations.
  
• Loïs Rigouste, Olivier Cappé, François Yvon:
  Inference and Evaluation of the Multinomial Mixture Model for Text Clustering.
  
• Shane Legg:
  Is there an Elegant Universal Theory of Prediction?
  
• Mehdi Ansari Sadrabadi, Alireza Bayesteh, Amir K. Khandani:
  Scheduling and Codeword Length Optimization in Time Varying Wireless Networks.
  
• Masahito Hasegawa:
  Relational Parametricity and Control.
  
• Muriel Roche, Philippe Réfrégier:
  Comparison of the estimation of the degree of polarization from four or two intensity images degraded by speckle noise.
  
• Yingbin Liang, Gerhard Kramer:
  Rate Regions for Relay Broadcast Channels.
  
• Lyublena Antova, Christoph Koch, Dan Olteanu:
  10^(10^6) Worlds and Beyond: Efficient Representation and Processing of Incomplete Information.
  
• Bin Bin Chen, Pascale Primet:
  A Flexible Bandwidth Reservation Framework for Bulk Data Transfers in Grid Networks.
  
• Daniil Ryabko, Marcus Hutter:
  On Sequence Prediction for Arbitrary Measures.
  
• David Doty:
  Dimension Extractors and Optimal Decompression.
  
• Chawki Hajjem, Stevan Harnad, Yves Gingras:
  Ten-Year Cross-Disciplinary Comparison of the Growth of Open Access and How it Increases Research Citation Impact.
  
• Philippe Chapdelaine:
  On the structure of linear-time reducibility.
  
• Jürgen Schmidhuber:
  New Millennium AI and the Convergence of History.
  
• Jonathan Ben-Naim:
  Lack of Finite Characterizations for the Distance-based Revision.
  
• Joakim Jalden, Björn E. Ottersten:
  The Diversity Order of the Semidefinite Relaxation Detector.
  
• Jean H. Gallier:
  The Completeness of Propositional Resolution: A Simple and Constructive Proof.
  
• Boris Ryabko, Daniil Ryabko:
  Provably Secure Universal Steganographic Systems.
  
• Alain Denise, Marie-Claude Gaudel, Sandrine-Dominique Gouraud, Richard Lassaigne, Sylvain Peyronnet:
  Uniform Random Sampling of Traces in Very Large Models.
  
• Bernd Gärtner, Jirka Matousek, Leo Rüst, Petr Skovron:
  Violator Spaces: Structure and Algorithms.
  
• Paulo A. Condado, Fernando G. Lobo:
  Breaking barriers for people with voice disabilities: Combining virtual keyboards with speech synthesizers, and VoIP applications.
  
• Charis Ermopoulos, William Yurcik:
  NVision-PA: A Tool for Visual Analysis of Command Behavior Based on Process Accounting Logs (with a Case Study in HPC Cluster Security).
  
• Chris Snow, Lutz H.-J. Lampe, Robert Schober:
  Error Rate Analysis for Coded Multicarrier Systems over Quasi-Static Fading Channels.
  
• Christel Baier, Nathalie Bertrand, Ph. Schnoebelen:
  On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems.
  
• María-del-Mar Gallardo, Christophe Joubert, Pedro Merino:
  Static Analysis using Parameterised Boolean Equation Systems.
  
• Vladimir Vovk:
  Predictions as statements and decisions.
  
• Wim Martens, Frank Neven, Marc Gyssens:
  On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas.
  
• Jean Krivine:
  A verification algorithm for Declarative Concurrent Programming.
  
• Lea Cyrus:
  Building a resource for studying translation shifts.
  
• Andrew Krizhanovsky:
  Synonym search in Wikipedia: Synarcher.
  
• Jeff M. Phillips, Ran Liu, Carlo Tomasi:
  Outlier Robust ICP for Minimizing Fractional RMSD.
  
• Mohammad Ali Maddah-Ali, Amin Mobasher, Amir K. Khandani:
  Fairness in Multiuser Systems with Polymatroid Capacity Region.
  
• Marco Cuturi:
  The generating function of the polytope of transport matrices U(r,c) as a positive semidefinite kernel of the marginals r and c.
  
• Marc Daumas, David R. Lester:
  Stochastic Formal Methods: An application to accuracy of numeric software.
  
• Chengpu Wang:
  Toward Functionality Oriented Programming.
  
• Chengpu Wang:
  A New Floating Point Arithmetic with Error Tracking Capability.
  
• Te Sun Han:
  An information-spectrum approach to large deviation theorems.
  
• Salah Deeb, Benoît Iung:
  Iso9000 Based Advanced Quality Approach for Continuous Improvement of Manufacturing Processes.
  
• Sundeep B, Andrew Thangaraj:
  Self-orthogonality of q-ary Images of q^m-ary Codes and Quantum Code Construction.
  
• Ingrid Burbey, Gyuhyun Kwon, Uma Murthy, Nicholas F. Polys, Prince Vincent:
  Human Information Processing with the Personal Memex.
  
• Salah Baïna, Hervé Panetto, Khalid Benali:
  A Product Oriented Modelling Concept: Holons for systems synchronisation and interoperability.
  
• Manor Mendel, Assaf Naor:
  Maximum gradient embeddings and monotone clustering.
  
• Jochen Mundinger, Richard R. Weber, Gideon Weiss:
  Optimal Scheduling of Peer-to-Peer File Dissemination.
  
• Hind El Haouzi:
  Models simulation and interoperability using MDA and HLA.
  
• Salah Baïna, Gérard Morel:
  Product Centric Holons for Synchronisation and Interoperability in Manufacturing Environments.
  
• Marius Marin, Leon Moonen, Arie van Deursen:
  A common framework for aspect mining based on crosscutting concern sorts.
  
• Mohammad Rezaeian:
  Hidden Markov Process: A New Representation, Entropy Rate and Estimation Entropy.
  
• José Borges, Mark Levene:
  Evaluating Variable Length Markov Chain Models for Analysis of User Web Navigation Sessions.
  
• Philip Bille:
  New Algorithms for Regular Expression Matching.
  
• Fabrice Portier, Rodolphe Legouable, L. Maret, F. Bauer, N. Neda, Jean-François Hélard, E. Hemming, M. Des Noes, Maryline Hélard:
  Performance comparison of multi-user detectors for the downlink of a broadband MC-CDMA system.
  
• Sophie Aubin, Adeline Nazarenko, Claire Nedellec:
  Adapting a general parser to a sublanguage.
  
• Sampo Pyysalo, Tapio Salakoski, Sophie Aubin, Adeline Nazarenko:
  Lexical Adaptation of Link Grammar to the Biomedical Sublanguage: a Comparative Evaluation of Three Approaches.
  
• Enrico Formenti, Benoît Masson, Theophilos Pisokas:
  On symmetric sandpiles.
  
• Kaibin Huang, Robert W. Heath Jr., Jeffrey G. Andrews:
  Joint Beamforming and Scheduling for SDMA Systems with Limited Feedback.
  
• Wolfgang Müller, P. Oscar Boykin, Nima Sarshar, Vwani P. Roychowdhury:
  Comparison of Image Similarity Queries in P2P Systems.
  
• Atos Ramos Alves:
  Use MPLS in Lan's.
  
• Sean M. Falconer, Dmitri Maslov:
  Weighted hierarchical alignment of directed acyclic graph.
  
• Marius Marin:
  Formalizing typical crosscutting concerns.
  
• Eldan Goldenberg, Jacob R. Garcowski, Randall D. Beer:
  May We Have Your Attention: Analysis of a Selective Attention Task.
  
• Tim Roughgarden, Mukund Sundararajan:
  Approximately Efficient Cost-Sharing Mechanisms.
  
• Andrew Krizhanovsky:
  Automatic forming lists of semantically related terms based on texts rating in the corpus with hyperlinks and categories (In Russian).
  
• Luca Dall'Asta, Andrea Baronchelli:
  Microscopic activity patterns in the Naming Game.
  
• Abolfazl Ramezanpour, S. Moghimi-Araghi:
  Simplifying Random Satisfiability Problem by Removing Frustrating Interactions.
  
• Thierry Mora, Olivier Rivoire:
  Statistical mechanics of error exponents for error-correcting codes.
  
• A. Caranti, Francesca Dalla Volta, M. Sala, F. Villani:
  Imprimitive permutations groups generated by the round functions of key-alternating block ciphers and truncated differential cryptanalysis.
  
• Marcus Hutter:
  Bayesian Regression of Piecewise Constant Functions.
  
• Rami Kanhouche:
  Entropy And Vision.
  
• Alexander Barg, Oleg R. Musin:
  Codes in spherical caps.
  
• Antoine Moreau, Olivier Teytaud, Jean-Pierre Bertoglio:
  Optimal estimation for Large-Eddy Simulation of turbulence and application to the analysis of subgrid models.
  
• Lluis Masanes, Andreas Winter:
  Unconditional security of key distribution from causality constraints.
  
• François Le Gall:
  Exponential Separation of Quantum and Classical Online Space Complexity.
  
• Ilya Mironov, Anton Mityagin, Kobbi Nissim:
  Hard Instances of the Constrained Discrete Logarithm Problem.
  
• George I. Bell:
  Diagonal Peg Solitaire.
  

Last update Thu May 23 18:32:18 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page