![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
CoRR, June 2004
- Kim-Chi Nguyen, Gilles Van Assche, Nicolas J. Cerf:
Side-Information Coding with Turbo Codes and its Application to Quantum Key Distribution. - Thomas Fischbacher:
A novel approach to symbolic algebra. - André Kempe, Franck Guingne, Florent Nicart:
Algorithms for weighted multi-tape automata. - Muhammad Nadeem, Syed Ata Hussain Jaffri:
Application of Business Intelligence In Banks (Pakistan). - George Candea, Shinichi Kawamoto, Yuichi Fujiki, Greg Friedman, Armando Fox:
A Microrebootable System - Design, Implementation, and Evaluation. - Edith Hemaspaandra:
Dichotomy Theorems for Alternation-Bounded Quantified Boolean Formulas. - Jiri Ocenasek, Martin Pelikan:
Parallel Mixed Bayesian Optimization Algorithm: A Scaleup Analysis. - Vyacheslav Zavadsky:
Image compression by rectangular wavelet transform. - Jean-Philippe Rennard:
Implementation of Logical Functions in the Game of Life. - Yidong Sun:
Another Proof of an Extension of a Curious Identity. - Cosma Rohilla Shalizi, Kristina Lisa Shalizi:
Blind Construction of Optimal Nonlinear Recursive Predictors for Discrete Sequences. - Seng Wai Loke, Andrew Davison:
Secure Prolog-Based Mobile Code. - Gianluigi Greco, Sergio Greco, Irina Trubitsyna, Ester Zumpano:
Optimization of Bound Disjunctive Queries with Constraints. - Richard A. O'Keefe:
O(1) Reversible Tree Navigation Without Cycles. - Damián H. Zanette:
Zipf's law and the creation of musical context. - Christoph Koch, Stefanie Scherzinger, Nicole Schweikardt, Bernhard Stegmaier:
Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams. - Stephen P. Luttrell:
Using Self-Organising Mappings to Learn the Structure of Data Manifolds. - Alexei A. Eremin:
Effects of wireless computing technology. - Victor Firoiu, Xiaohui Zhang, Emre Gündüzhan, Nicolas Christin
:
Providing Service Guarantees in High-Speed Switching Systems with Feedback Output Queuing. - David Eppstein:
Algorithms for Drawing Media. - Alexandre d'Aspremont, Laurent El Ghaoui, Michael I. Jordan, Gert R. G. Lanckriet:
A direct formulation for sparse PCA using semidefinite programming. - David King, Chris Kimble:
Uncovering the epistemological and ontological assumptions of software designers. - David King, Chris Kimble:
Notions of Equivalence in Software Design. - Vida Dujmovic, Pat Morin, David R. Wood:
Layout of Graphs with Bounded Tree-Width. - Frédéric Goualard, Laurent Granvilliers:
Directional Consistency for Continuous Numerical Constraints. - Tom Schrijvers, Alexander Serebrenik:
Improving Prolog Programs: Refactoring for Prolog. - Dietrich Fahrenholtz, Volker Turau:
Fluctuation in Peer-to-Peer Networks: Mitigating Its Effect on DHT Performance. - Yair Bartal, Béla Bollobás, Manor Mendel:
Ramsey-type theorems for metric spaces with applications to online problems. - Satyanarayana R. Valluri, Kamalakar Karlapalem:
Subset Queries in Relational Databases. - Maria Paola Bonacina, Nachum Dershowitz:
Abstract Canonical Inference. - Long Qiu, Min-Yen Kan, Tat-Seng Chua:
A Public Reference Implementation of the RAP Anaphora Resolution Algorithm. - José Luís Cabral de Moura Borges, Mark Levene:
A Dynamic Clustering-Based Markov Model for Web Usage Mining. - (Withdrawn) Randomized k-server algorithms for growth-rate bounded graphs.
- Amos Fiat, Manor Mendel:
Better algorithms for unfair metrical task systems and applications. - Ali Ahmadinia, Christophe Bobda, Sándor P. Fekete, Jürgen Teich, Jan van der Veen:
Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices. - Manor Mendel, Steven S. Seiden:
Online Companion Caching. - Giorgi Japaridze:
Propositional Computability Logic II. - Vladan Vuckovic, Djordje Vidanovic:
A New Approach to Draw Detection by Move Repetition in Computer Chess Programming. - Sergey Yekhanin, Ilya Dumer:
Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance. - Bonifac Donat:
Alchemistry of the P versus NP question. - Étienne Payet, Frédéric Mesnard:
Non-Termination Inference of Logic Programs. - Valdis Vitolins:
Business Process Measures. - Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen:
The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy. - Frank Harary, Wolfgang Slany, Oleg Verbitsky:
On Computational Complexity of the Forcing Chromatic Number. - Erik D. Demaine, Sándor P. Fekete, Shmuel Gal:
Online Searching with Turn Cost. - Andrew C. Huang, Armando Fox:
Cheap Recovery: A Key to Self-Managing State. - G. A. Ososkov, S. G. Dmitrievskiy, Alexey V. Stadnik:
Self-organizing neural networks in classification and image recognition. - Heeralal Janwa, Arbind K. Lal:
On Expanders Graphs: Parameters and Applications. - Marcus H. Mendenhall:
A Fast, Vectorizable Algorithm for Producing Single-Precision Sine-Cosine Pairs. - Abdelaziz Amraoui, Andrea Montanari, Thomas J. Richardson, Rüdiger L. Urbanke:
Finite-Length Scaling for Iteratively Decoded LDPC Ensembles. - Somdeb Lahiri:
Stable Outcomes for Two-Sided Contract Choice Problems. - Maximillian Dornseif, Thorsten Holz, Christian N. Klein:
NoSEBrEaK - Attacking Honeynets. - Kishori M. Konwar, Ion I. Mandoiu, Alexander Russell, Alexander A. Shvartsman:
Approximation Algorithms for Minimum PCR Primer Set Selection with Amplification Length and Uniqueness Constraints. - J. J. Paijmans:
Building a linguistic corpus from bee dance data. - Andrea Ferrara:
Web Services: A Process Algebra Approach. - Selmer Bringsjord, Joshua Taylor:
P=NP. - Maximillian Dornseif, Sascha May:
Modelling the costs and benefits of Honeynets. - Matthias Bauer:
Proofs of Zero Knowledge. - Maximillian Dornseif, Felix C. Gärtner, Thorsten Holz:
Ermittlung von Verwundbarkeiten mit elektronischen Koedern. - Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren:
Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery. - Scott Aaronson:
The Complexity of Agreement. - Nima Sarshar, P. Oscar Boykin, Vwani P. Roychowdhury:
Scalable Percolation Search in Power Law Networks. - Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain Barrat, Alexei Vázquez, Alessandro Vespignani:
A statistical approach to the traceroute-like exploration of networks: theory and simulations. - Peter Grünwald:
A tutorial introduction to the minimum description length principle. - Philippe Chassaing, Régine Marchand:
Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms. - Peter Grünwald, John Langford:
Suboptimal behaviour of Bayes and MDL in classification under misspecification. - Mark Braverman, Michael Yampolsky:
Non-computable Julia sets. - Sabbir Rahman, Mahbub Majumdar:
Maximum Entropy Multivariate Density Estimation: An exact goodness-of-fit approach. - Ilya Nemenman:
Information theory, multivariate dependence, and genetic network inference. - Julia Kempe, Aner Shalev:
The hidden subgroup problem and permutation group theory. - Alexander Yu. Vlasov:
On Quantum Cellular Automata. - Sudhir Kumar Singh, Sudebkumar Prasant Pal, Somesh Kumar, R. Srikanth:
A combinatorial approach for studying LOCC transformations of multipartite states. - Julia Kempe, Alexei Y. Kitaev, Oded Regev:
The Complexity of the Local Hamiltonian Problem. - Scott Aaronson, Daniel Gottesman:
Improved Simulation of Stabilizer Circuits.
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.